On L(2, 1)-coloring split, chordal bipartite, and weakly chordal graphs.
Márcia R. CerioliDaniel F. D. PosnerPublished in: Discret. Appl. Math. (2012)
Keyphrases
- undirected graph
- directed graph
- bipartite graph
- approximation algorithms
- spanning tree
- adjacency matrix
- complex networks
- graph partitioning
- graph structure
- graph model
- minimum cost
- directed acyclic graph
- perfect phylogeny
- random graphs
- connected components
- graph matching
- graph representation
- pairwise
- path consistency
- search algorithm
- information retrieval