ISSN:
1432-0541
Keywords:
Biconnected graph
;
Bridge
;
Ambitus
;
Planar graphs
;
Graph algorithms
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract A cycleC passing through two specific verticess andt of a biconnected graph is said to be anst-ambitus if its bridges do not interlace in some special way. We present algorithms forst-ambitus for planar biconnected graphs, which are much simpler than the one known for general graphs [MT]. Our algorithm runs inO(n) time on a sequential machine and (logn) parallel time usingO(n/logn) processors on an EREW PRAM.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01975868
Permalink