106 search results - page 15 / 22 » Edge clique graphs and some classes of chordal graphs |
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
101
click to vote
DAM
2002
14 years 11 months ago
2002
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
DAM
2008
14 years 11 months ago
2008
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
115
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
WG
2009
Springer
15 years 6 months ago
2009
Springer
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. So far, finding an exact al...