✦ LIBER ✦

Miscellaneous problems on infinite graphs

✍ Scribed by R. Halin

Publisher: John Wiley and Sons
Year: 2000
Tongue: English
Weight: 213 KB
Volume: 35
Category: Article
ISSN: 0364-9024
DOI: 10.1002/1097-0118(200010)35:2<128::aid-jgt6>3.0.co;2-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

r-domination problems on homogeneously o

r-domination problems on homogeneously orderable graphs

✍ Dragan, Feodor F.; Nicolai, Falk 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB 👁 2 views

In this paper, we consider r-dominating cliques in homogeneously orderable graphs (a common generalization of dually chordal and distance-hereditary graphs) and their relation to strict r-packing sets. We prove that a homogeneously orderable graph G possesses an r-dominating clique if and only if fo

A note on the bottleneck graph partition

A note on the bottleneck graph partition problem

✍ Klinz, Bettina; Woeginger, Gerhard J. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 47 KB 👁 2 views

The bottleneck graph partition problem consists of partitioning the vertices of an undirected edge-weighted graph into two equally sized sets such that the maximum edge weight in the cut separating the two sets becomes minimum. In this short note, we present an optimum algorithm for this problem wit

Deferred-query: An efficient approach fo

Deferred-query: An efficient approach for some problems on interval graphs

✍ Chang, Maw-Shang; Peng, Sheng-Lung; Liaw, Jenn-Liang 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 99 KB 👁 2 views

This paper introduces the idea of a deferred-query approach to design O(n) algorithms for the domatic partition, optimal path cover, Hamiltonian path, Hamiltonian circuit, and maximum matching problems on interval graphs given n endpoint-sorted intervals. The previous best-known algorithms run in O(

On the value function for optimal contro

On the value function for optimal control problems with infinite horizon

✍ A. Leitão 📂 Article 📅 2002 🏛 John Wiley and Sons ⚖ 104 KB 👁 2 views

The searchlight guarding problem on weig

The searchlight guarding problem on weighted split graphs and weighted cographs

✍ Yen, William C. K.; Tang, C. Y. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 223 KB 👁 1 views

This paper addresses the searchlight guarding problem, which is an extension of so-called graph searching/guarding problem on a weighted, undirected graph G by considering the time-slot parameter in addition to the traditional building cost. Given a weighted, undirected graph G G G, suppose that the

A survey of solved problems and applicat

A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs

✍ Lai, Yung-Ling; Williams, Kenneth 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 281 KB

This article provides a survey of results on the exact bandwidth, edgesum, and profile of graphs. A bibliography of work in these areas is provided. The emphasis is on composite graphs. This may be regarded as an update of the original survey of solved bandwidth problems by Chinn, Chvátalová, Dewdne