Succinct data structures for bounded clique-width graphs.
Sankardeep ChakrabortySeungbum JoKunihiko SadakaneSrinivasa Rao SattiPublished in: Discret. Appl. Math. (2024)
Keyphrases
- data structure
- independent set
- graph properties
- maximum clique
- quasi cliques
- graph theoretic
- efficient data structures
- graph matching
- series parallel
- graph representation
- maximum independent set
- bounded treewidth
- graph mining
- graph structure
- directed graph
- spanning tree
- graph theory
- weighted graph
- maximum weight
- bipartite graph
- bounded degree
- data types
- knn