✦ LIBER ✦

The path-partition problem in block graphs

✍ Scribed by Jing-Ho Yan; Gerard J. Chang

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 408 KB
Volume: 52
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(94)00158-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Paths in r-partite self-complementary gr

Paths in r-partite self-complementary graphs

✍ T. Gangopadhyay; S.P. Rao Hebbare 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 683 KB

It is shown that. every connected bi-p.s.c, graphs G(2I of order p. with a bi-partite complementing permutation (bi-p.e.p) o" having mixed cycles, has a (p-3)-path and this result is best possible. Further. if the graph induced on each cycle of bi-p.c.p, of G( 2) is connected then G(2) has a hamilto

The bottleneck graph partition problem

✍ Hochbaum, Dorit S.; Pathria, Anu 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 401 KB 👁 2 views

The bottleneck graph partition problem is to partition the nodes of a graph into two equally sized sets, so that the maximum edge weight in the cut separating the two sets is minimum. Whereas the graph partition problem, where the sum of the edge weights in the cut is to be minimized, is NP-hard, th

On the minimum path problem in Knödel gr

On the minimum path problem in Knödel graphs

✍ Hovhannes A. Harutyunyan; Calin D. Morosan 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB

The Isomorphism Problem For Directed Pat

The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs

✍ L. Babel; I.N. Ponomarenko; G. Tinhofer 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 237 KB

This paper deals with the isomorphism problem of directed path graphs and rooted directed path graphs. Both graph classes belong to the class of chordal graphs, and for both classes the relative complexity of the isomorphism problem is yet unknown. We prove that deciding isomorphism of directed path

Algorithms for the minimum partitioning

Algorithms for the minimum partitioning problems in graphs

✍ Hiroshi Nagamochi 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 545 KB

## Abstract In this paper, the author explains the recent evolution of algorithms for minimum partitioning problems in graphs. When the set of vertices of a graph having non‐negative weights for edges is divided into __k__ subsets, the set of edges for which both endpoints are contained in differen

The cardinality-constrained shortest pat

The cardinality-constrained shortest path problem in 2-graphs

✍ Geir Dahl; Bjørnar Realfsen 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB 👁 2 views