𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs

✍ Scribed by C.M.H. de Figueiredo; L. Faria; S. Klein; R. Sritharan

Book ID
108281321
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
722 KB
Volume
381
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Complexity of approximating the oriented
Complexity of approximating the oriented diameter of chordal graphs
✍ Fedor V. Fomin; MartΓ­n Matamala; Ivan Rapaport πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 135 KB

## Abstract The oriented diameter of a bridgeless connected undirected (__bcu__) graph __G__ is the smallest diameter among all the diameters of strongly connected orientations of __G__. We study algorithmic aspects of determining the oriented diameter of a chordal graph. We (a) construct a linear‐