6740 search results - page 376 / 1348 » An s -Hamiltonian Line Graph Problem |
144
click to vote
SIAMDM
2002
15 years 4 months ago
2002
Let Hn be the number of claw-free cubic graphs on 2n labeled nodes. Combinatorial reductions are used to derive a second order, linear homogeneous differential equation with polyno...
155
Voted
MST
2010
15 years 3 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
145
click to vote
ISAAC
2009
Springer
15 years 9 months ago
2009
Springer
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...
159
Voted
ICPR
2004
IEEE
16 years 5 months ago
2004
IEEE
Corner matching constitutes a fundamental vision problem that serves as a building block of several important applications. The common approach to dealing with this problem starts...
171
Voted
STOC
2006
ACM
16 years 5 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...