16666 search results - page 119 / 3334 » Descriptive and Computational Complexity |
CORR
2004
Springer
15 years 3 months ago
2004
Springer
73
Voted
AUTOMATICA
2000
15 years 3 months ago
2000
CORR
2002
Springer
15 years 3 months ago
2002
Springer
IGPL
2000
15 years 3 months ago
2000
134
click to vote
DAM
2002
15 years 3 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 ...