Polynomial-time algorithms for minimum weighted colorings of ()-free graphs and similar graph classes.
Chính T. HoàngD. Adam LazzaratoPublished in: Discret. Appl. Math. (2015)
Keyphrases
- polynomial time complexity
- graph theory
- planar graphs
- graph isomorphism
- np complete
- directed graph
- edge weights
- bipartite graph
- weighted graph
- graph model
- maximum clique
- maximum cardinality
- graph theoretic
- graph databases
- dynamic graph
- special case
- random graphs
- graph construction
- graph data
- subgraph isomorphism
- graph search
- equivalence classes
- minimum spanning tree
- spanning tree
- graph structure
- graph matching
- computational complexity
- graph embedding
- learning algorithm
- graph classification
- graph representation
- spectral graph