Weighted and locally bounded list-colorings in split graphs, cographs, and partial k-trees.
Cédric BentzPublished in: CoRR (2017)
Keyphrases
- bounded degree
- association graph
- weighted graph
- graph theoretic
- decision trees
- spectral graph
- bounded treewidth
- labeled trees
- gain ratio
- graph matching
- graph model
- graph structure
- tree structure
- tree nodes
- graph partitioning
- graph representation
- graph mining
- tree structured data
- tree structures
- series parallel
- tree models
- maximal cliques
- graph clustering
- complex structures
- graph theory
- random walk