871 search results - page 44 / 175 » The vertex-cover polynomial of a graph |
139
click to vote
COCOON
2007
Springer
16 years 9 days ago
2007
Springer
Abstract. We show that minimal k-vertex connected spanning subgraphs of a given graph can be generated in incremental polynomial time for any fixed k.
139
click to vote
CSC
2006
15 years 7 months ago
2006
- The purpose of this paper is to develop an algorithm to determine the Hamilton Circuit in a given graph of degree three. This algorithm will find Hamilton Circuit in polynomial s...
181
click to vote
SIAMDM
2010
15 years 26 days ago
2010
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
170
click to vote
CSR
2009
Springer
16 years 21 days ago
2009
Springer
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...
126
click to vote
CAGD
2007
15 years 6 months ago
2007
We present an algorithm which is able to compute all roots of a given univariate polynomial within a given interval. In each step, we use degree reduction to generate a strip boun...