A Linear Time Algorithm for the Minimum-weight Feedback Vertex Set Problem in Series-parallel Graphs

Author： Zhang Shao-qiang Li Guo-jun Li Shu-guang

ISSN： 0168-9673

Source： Acta Mathematicae Applicatae Sinica, Vol.20, Iss.4, 2004-11, pp. : 579-588

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

The Entire Coloring of Series-Parallel Graphs

By Wu Jian-liang Wu Yu-liang

Acta Mathematicae Applicatae Sinica, Vol. 21, Iss. 1, 2005-02 ,pp. : 61-66

Springer Publishing Company

Access to resources Recommend Favorite

On the stabilizers of the minimum-weight codewords of some binary codes from graphs on triples

By Rodrigues B.G.

Quaestiones Mathematicae, Vol. 30, Iss. 1, 2007-03 ,pp. : 21-26

Taylor & Francis Ltd

Access to resources Recommend Favorite

An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three

RANDOM STRUCTURES AND ALGORITHMS, Vol. 47, Iss. 1, 2015-08 ,pp. : 73-98

John Wiley & Sons Inc

Access to resources Recommend Favorite

A 2-approximation algorithm for the vertex cover P₄ problem in cubic graphs

By Li Yuchao Tu Jianhua

International Journal of Computer Mathematics, Vol. 91, Iss. 10, 2014-10 ,pp. : 2103-2108

Taylor & Francis Ltd

Access to resources Recommend Favorite

An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs

By Zhou X. Suzuki H. Nishizeki T.

Journal of Algorithms, Vol. 23, Iss. 2, 1997-05 ,pp. : 359-374

Academic Press

Access to resources Recommend Favorite