✦ LIBER ✦

A problem of tree graph

✍ Scribed by Hao Li; Qun Liu

Book ID: 112947739
Publisher: Springer
Year: 1989
Tongue: English
Weight: 301 KB
Volume: 4
Category: Article
ISSN: 1000-9000
DOI: 10.1007/bf02943989

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximizing the total number of spanning

Maximizing the total number of spanning trees in a graph: Two related problems in graph theory and optimum design theory

✍ Ching-Shui Cheng 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 436 KB

Polynomial-time algorithms for solving a

Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs

✍ Siqian Shen; J. Cole Smith 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 367 KB 👁 1 views

Solving coloring, minimum clique cover a

Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree

✍ Olivier Durand de Gevigney; Frédéric Meunier; Christian Popa; Julien Reygner; Ay 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 318 KB

Inverse eigenvalue problems and lists of

Inverse eigenvalue problems and lists of multiplicities of eigenvalues for matrices whose graph is a tree: the case of generalized stars and double generalized stars

✍ Charles R. Johnson; António Leal Duarte; Carlos M. Saiago 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 201 KB

The minimum spanning tree problem on a p

The minimum spanning tree problem on a planar graph

✍ Tomomi Matsui 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 301 KB

On the complexity of graph tree partitio

On the complexity of graph tree partition problems

✍ Roberto Cordone; Francesco Maffioli 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 270 KB

This paper concerns the optimal partition of a graph into p connected clusters of vertices, with various constraints on their topology and weight. We consider di erent objectives, depending on the cost of the trees spanning the clusters. This rich family of problems mainly applies to telecommunicati