74 search results - page 2 / 15 » New length bounds for cycle bases |
STACS
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
ENTCS
2006
13 years 7 months ago
2006
Increasing attention has been paid recently to criteria that allow one to conclude that a structure models a linear-time property from the knowledge that no counterexamples exist ...
JCO
2010
13 years 5 months ago
2010
An important task in the theory of hypercubes is to establish the maximum integer fn such that for every set F of f vertices in the hypercube Qn, with 0 ≤ f ≤ fn, there exists ...
CP
2008
Springer
13 years 9 months ago
2008
Springer
Recently, a new domain store for set-variables has been proposed which totally orders all values in the domain of a set-variable based on cardinality and lexicography. Traditionall...
TVLSI
1998
13 years 7 months ago
1998
Abstract—Pseudoexhaustive testing involves applying all possible input patterns to the individual output cones of a combinational circuit. Based on our new algebraic results, we ...