Avoidable Vertices and Edges in Graphs.
Jesse BeisegelMaria ChudnovskyVladimir GurvichMartin MilanicMary ServatiusPublished in: CoRR (2019)
Keyphrases
- weighted graph
- undirected graph
- edge weights
- directed edges
- directed graph
- vertex set
- spanning tree
- graph model
- graph partitioning
- labeled graphs
- minimum weight
- adjacency matrix
- random graphs
- graph structure
- graph clustering
- shortest path
- bipartite graph
- minimum cost
- connected components
- approximation algorithms
- directed acyclic graph
- attributed graphs
- densely connected
- real world graphs
- graph theory
- edge information
- maximum cardinality
- spectral embedding
- average degree
- query graph
- maximal cliques
- minimum spanning tree
- graph theoretic
- graph matching
- planar graphs
- maximum matching
- graph structures
- connected subgraphs
- massive graphs
- graph kernels
- social networks