871 search results - page 43 / 175 » The vertex-cover polynomial of a graph |
TCS
2008
14 years 9 months ago
2008
This paper deals with the existence and search of properly edgecolored paths/trails between two, not necessarily distinct, vertices s and t in an edge-colored graph from an algori...
WALCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
Treewidth and pathwidth are important graph parameters that represent how close the graph is to trees and paths respectively. We calculate treewidth and pathwidth on parameterized ...
SIAMDM
2008
14 years 9 months ago
2008
In a recent paper, Dur
95
Voted
IWOCA
2010
Springer
14 years 4 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
102
click to vote
IPL
2008
14 years 9 months ago
2008
We use transfer matrix methods to determine bounds for the numbers of legal Go positions for various numbers of players on some planar lattice graphs, including square lattice gra...