Author： Berger Franziska Gritzmann Peter Vries Sven
Publisher： Springer Publishing Company
ISSN： 0178-4617
Source： Algorithmica, Vol.40, Iss.1, 2004-06, pp. : 51-62
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
Access to resources
Recommend
Minimum Weakly Fundamental Cycle Bases Are Hard To Find
By Rizzi Romeo
Algorithmica, Vol. 53, Iss. 3, 2009-03 ,pp. :
On treewidth and minimum fill-in of asteroidal triple-free graphs
By Kloks T. Kratsch D. Spinrad J.
Theoretical Computer Science, Vol. 175, Iss. 2, 1997-04 ,pp. :
The Complexity of Finding a Second Hamiltonian Cycle in Cubic Graphs
By Krawczyk A.
Journal of Computer and System Sciences, Vol. 58, Iss. 3, 1999-06 ,pp. :