Complexity-separating graph classes for vertex, edge and total colouring.
Celina M. H. de FigueiredoPublished in: Discret. Appl. Math. (2020)
Keyphrases
- undirected graph
- edge weights
- weighted graph
- vertex set
- directed graph
- strongly connected
- directed acyclic graph
- graph structure
- computational complexity
- minimum weight
- tractable cases
- disjoint paths
- bipartite graph
- complexity measures
- shortest path
- edge detection
- worst case
- spanning tree
- computational cost
- approximation algorithms
- equivalence classes
- edge information
- graph model
- connected components
- graph theoretic
- graph representation
- graph partitioning
- random graphs
- space complexity
- graph theory
- graph matching
- hamiltonian cycle
- polynomial time complexity
- np hard