✦ LIBER ✦

On the complexity of graph reconstruction

✍ Scribed by Dieter Kratsch; Lane A. Hemaspaandra

Publisher: Springer
Year: 1994
Tongue: English
Weight: 942 KB
Volume: 27
Category: Article
ISSN: 1433-0490
DOI: 10.1007/bf01578845

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of reconstructing H-fr

On the complexity of reconstructing H-free graphs from their Star Systems

✍ Fedor V. Fomin; Jan Kratochvíl; Daniel Lokshtanov; Federico Mancini; Jan Arne Te 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB

On the computational complexity of graph

On the computational complexity of graph closures

✍ Angelo Monti 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 375 KB

On the recognition complexity of some gr

On the recognition complexity of some graph properties

✍ Eberhard Triesch 📂 Article 📅 1996 🏛 Springer-Verlag 🌐 English ⚖ 487 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

On the Parameterized Complexity of Layer

On the Parameterized Complexity of Layered Graph Drawing

✍ Vida Dujmović; Michael R. Fellows; Matthew Kitching; Giuseppe Liotta; Catherine 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 537 KB

The graph reconstruction number

✍ Frank Harary; Michael Plantholt 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 177 KB

Dedicated ro the memory of Stan Ulam (31.