2430 search results - page 360 / 486 » Computing Tutte Polynomials |
135
click to vote
MFCS
2007
Springer
15 years 9 months ago
2007
Springer
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by me...
149
click to vote
STACS
2007
Springer
15 years 9 months ago
2007
Springer
In this paper, it is shown that the Feedback Vertex Set problem on unweighted, undirected graphs has a kernel of cubic size. I.e., a polynomial time algorithm is described, that, w...
109
Voted
WG
2007
Springer
15 years 9 months ago
2007
Springer
For a 3-colourable graph G, the 3-colour graph of G, denoted C3(G), is the graph with node set the proper vertex 3-colourings of G, and two nodes adjacent whenever the correspondi...
145
click to vote
3DPVT
2006
IEEE
15 years 9 months ago
2006
IEEE
Self-calibration is one of the most active issues concerning vision-based 3D measurements. However, in the case of the light sectioning method, there has been little research cond...
127
Voted
BROADNETS
2006
IEEE
15 years 9 months ago
2006
IEEE
— We introduce a new algorithmic framework for advanced channel reservation in ultra high speed networks, called Graded Channel Reservation (GCR). GCR allows users to specify min...