Short Cycles Connectivity

Details Short Cycles Connectivity Short Cycles Connectivity

2003-08-05

arxiv.org/abs/cs/0308011v2

Computer Science

Data Structures and Algorithms

Scientific paper

Short cycles connectivity is a generalization of ordinary connectivity. Instead by a path (sequence of edges), two vertices have to be connected by a sequence of short cycles, in which two adjacent cycles have at least one common vertex. If all adjacent cycles in the sequence share at least one edge, we talk about edge short cycles connectivity. It is shown that the short cycles connectivity is an equivalence relation on the set of vertices, while the edge short cycles connectivity components determine an equivalence relation on the set of edges. Efficient algorithms for determining equivalence classes are presented. Short cycles connectivity can be extended to directed graphs (cyclic and transitive connectivity). For further generalization we can also consider connectivity by small cliques or other families of graphs.

Affiliated with

Also associated with

No associations

Rating

Short Cycles Connectivity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Short Cycles Connectivity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Short Cycles Connectivity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-571765