Covering Many (Or Few) Edges with k Vertices in Sparse Graphs.
Tomohiro KoanaChristian KomusiewiczAndré NichterleinFrank SommerPublished in: STACS (2022)
Keyphrases
- weighted graph
- undirected graph
- densely connected
- edge weights
- directed edges
- directed graph
- vertex set
- spanning tree
- minimum weight
- labeled graphs
- shortest path
- attributed graphs
- adjacency matrix
- graph model
- graph mining
- random graphs
- graph partitioning
- high dimensional
- sparse representation
- planar graphs
- compressive sensing
- sparse data
- minimum cost
- real world graphs
- graph clustering
- approximation algorithms
- graph structure
- directed acyclic graph
- connected components
- spectral embedding
- graph matching
- community structure
- complex networks
- hamiltonian cycle
- graph kernels
- maximal cliques
- sparse coding
- edge information
- connected subgraphs
- directed acyclic