15 search results - page 1 / 3 » Bicolored Matchings in Some Classes of Graphs |
GC
2007
Springer
13 years 10 months ago
2007
Springer
JGAA
2000
13 years 10 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
DAM
1999
13 years 10 months ago
1999
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...
STACS
2010
Springer
14 years 5 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
ISAAC
2007
Springer
14 years 5 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...