Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage.
Girish BalakrishnanSankardeep ChakrabortyN. S. NarayanaswamyKunihiko SadakanePublished in: CoRR (2024)
Keyphrases
- undirected graph
- data structure
- directed graph
- attributed graphs
- directed acyclic
- labeled graphs
- spanning tree
- connected components
- graph structure
- complex networks
- directed acyclic graph
- vertex set
- approximation algorithms
- r tree
- random graphs
- average degree
- space efficient
- maximum cardinality
- edge weights
- graph theoretic
- suffix tree
- graph matching
- graph theory
- main memory
- tree structure
- efficient data structures
- bounded degree
- connected subgraphs
- bipartite graph
- minimum weight
- strongly connected
- hamiltonian cycle
- index structure
- random walk
- np hard