On computing the vertex connectivity of 1-plane graphs.
Therese BiedlKarthik MuraliPublished in: CoRR (2022)
Keyphrases
- directed graph
- undirected graph
- attributed graphs
- labeled graphs
- hamiltonian cycle
- graph theoretic
- three dimensional
- graph matching
- connected components
- graph construction
- strongly connected
- connected subgraphs
- average degree
- triangle mesh
- topological information
- minimum weight
- subgraph isomorphism
- random graphs
- graph representation
- approximation algorithms
- pairwise