𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimaximal Paths in Disjunctive Graphs by Direct Search

✍ Scribed by Raimond, J.-F.

Book ID
115483683
Publisher
IBM
Year
1969
Tongue
English
Weight
729 KB
Volume
13
Category
Article
ISSN
0018-8646

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Characterizing directed path graphs by f
Characterizing directed path graphs by forbidden asteroids
✍ Kathie Cameron; ChΓ­nh T. HoΓ ng; Benjamin LΓ©vΓͺque πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 135 KB

An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. Asteroidal triples play a central role in a classical characterization of interval graphs by Lekkerkerker and Boland. Their result says that a chordal grap

Paths and circuits in partially directed
Paths and circuits in partially directed graphs
✍ D.W. Barnette; Shelley Gillett πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 244 KB

Although questions about Eulerian circuits, paths, and covering edges by edge disjoint paths are easily answered for graphs or directed graphs, they are not easily answered if some edges are directed and others are not. We give necessary and sufficient conditions for an Eulerian path or circuit, and

Optimal tree 3-spanners in directed path
Optimal tree 3-spanners in directed path graphs
✍ Le, HoοΏ½ng-Oanh; Le, Van Bang πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 122 KB πŸ‘ 2 views

In a graph G, a spanning tree T is called a tree t-spanner of G if the distance between any two vertices in T is at most t times their distance in G. While the complexity of finding a tree t-spanner of a given graph is known for any fixed t 3, the case t Ο­ 3 still remains open. In this article, we s