๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Efficient reduction for path problems on circular-arc graphs

โœ Scribed by Srinivasa R. Arikati; C. Pandu Rangan; Glenn K. Manacher

Book ID
105402498
Publisher
Springer Netherlands
Year
1991
Tongue
English
Weight
509 KB
Volume
31
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Efficient algorithms for interval graphs
Efficient algorithms for interval graphs and circular-arc graphs
โœ U. I. Gupta; D. T. Lee; J. Y.-T. Leung ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 476 KB

## Abstract We show that for an interval graph given in the form of a family of intervals, a maximum independent set, a minimum covering by disjoint completely connected sets or cliques, and a maximum clique can all be found in __O__(__n__ log __n__) time [__O__(__n__) time if the endpoints of the

Solving the all-pair shortest path query
Solving the all-pair shortest path query problem on interval and circular-arc graphs
โœ Chen, Danny Z.; Lee, D. T.; Sridhar, R.; Sekharan, Chandra N. ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 118 KB ๐Ÿ‘ 3 views

In this paper, we study the following all-pair shortest path query problem: Given the interval model of an unweighted interval graph of n vertices, build a data structure such that each query on the shortest path (or its length) between any pair of vertices of the graph can be processed efficiently