Computing the vertex connectivity of a locally maximal 1-plane graph in linear time.
Therese C. BiedlKarthik MuraliPublished in: CoRR (2021)
Keyphrases
- strongly connected
- directed graph
- connected components
- undirected graph
- hamiltonian cycle
- independent set
- graph connectivity
- vertex set
- graph representation
- graph theoretic
- minimum weight
- labeled graphs
- weighted graph
- graph structure
- graph theory
- three dimensional
- homology generators
- attributed graphs
- simple polygon
- average degree
- graph construction
- triangle mesh
- graph based algorithm
- topological information
- edge weights
- graph databases
- directed acyclic graph
- random graphs
- graph mining
- structured data