Covering Many (or Few) Edges with k Vertices in Sparse Graphs.
Tomohiro KoanaChristian KomusiewiczAndré NichterleinFrank SommerPublished in: CoRR (2022)
Keyphrases
- weighted graph
- undirected graph
- densely connected
- directed edges
- edge weights
- directed graph
- vertex set
- spanning tree
- adjacency matrix
- graph structure
- graph partitioning
- minimum weight
- directed acyclic graph
- graph mining
- random graphs
- real world graphs
- labeled graphs
- shortest path
- high dimensional
- sparse data
- average degree
- planar graphs
- graph clustering
- directed acyclic
- subgraph isomorphism
- connected components
- graph model
- approximation algorithms
- sparse representation
- graph structures
- minimum cost
- graph theoretic
- gaussian graphical models
- attributed graphs
- hamiltonian cycle
- graph matching
- community structure
- edge detector
- semi supervised