Polynomial-time algorithms for minimum weighted colorings of ($P_5, \bar{P}_5$)-free graphs and related graph classes.
Chính T. HoàngD. Adam LazzaratoPublished in: CoRR (2014)
Keyphrases
- graph theory
- polynomial time complexity
- graph isomorphism
- edge weights
- graph data
- graph model
- weighted graph
- computational complexity
- planar graphs
- learning algorithm
- spanning tree
- graph theoretic
- directed graph
- minimum spanning tree
- random graphs
- web graph
- graph representation
- np complete
- worst case
- graph theoretical
- graph construction
- dynamic graph
- special case
- maximum clique
- maximum flow
- graph structures
- subgraph isomorphism
- maximal cliques
- series parallel
- graph representations
- bipartite graph
- graph clustering
- graph matching
- graph mining