Efficient algorithms for a mixed k-partition problem of graphs without specifying bases

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.201, Iss.1, 1998-07, pp. : 233-248

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

Abstract

Related content

On the k-path partition of graphs

By Steiner G.

Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. : 2147-2155

Elsevier

Access to resources Recommend Favorite

Efficient algorithms for acyclic colorings of graphs

By Chen Z.-Z.

Theoretical Computer Science, Vol. 230, Iss. 1, 2000-01 ,pp. : 75-95

Elsevier

Access to resources Recommend Favorite

New Approximation Algorithms for Minimum Cycle Bases of Graphs

By Kavitha Telikepalli Mehlhorn Kurt Michail Dimitrios

Algorithmica, Vol. 59, Iss. 4, 2011-04 ,pp. : 471-488

Springer Publishing Company

Access to resources Recommend Favorite

Efficient parallel algorithms for doubly convex-bipartite graphs

By Chang-Wu Y. Gen-Huey C.

Theoretical Computer Science, Vol. 147, Iss. 1, 1995-08 ,pp. : 249-265

Elsevier

Access to resources Recommend Favorite

Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions

By Dorn Frederic Penninkx Eelko Bodlaender Hans Fomin Fedor

Algorithmica, Vol. 58, Iss. 3, 2010-11 ,pp. : 790-810

Springer Publishing Company

Access to resources Recommend Favorite