Clustered colouring of graph classes with bounded treedepth or pathwidth.
Sergey NorinAlex ScottDavid R. WoodPublished in: Comb. Probab. Comput. (2023)
Keyphrases
- bounded treewidth
- bounded degree
- np complete
- graph representation
- graph matching
- graph theory
- graph theoretic
- directed acyclic graph
- class labels
- decision problems
- connected components
- directed graph
- graph clustering
- equivalence classes
- graphical representation
- decision trees
- random walk
- graph databases
- graph mining
- graph structure
- boolean functions
- conjunctive queries
- social network analysis