Homogeneity vs. Adjacency: generalising some graph decomposition algorithms

Computer Science – Data Structures and Algorithms

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

soumis \`{a} WG 2006

Scientific paper

10.1007/11917496\_25

In this paper, a new general decomposition theory inspired from modular graph decomposition is presented. Our main result shows that, within this general theory, most of the nice algorithmic tools developed for modular decomposition are still efficient. This theory not only unifies the usual modular decomposition generalisations such as modular decomposition of directed graphs or decomposition of 2-structures, but also star cutsets and bimodular decomposition. Our general framework provides a decomposition algorithm which improves the best known algorithms for bimodular decomposition.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Homogeneity vs. Adjacency: generalising some graph decomposition algorithms 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 Homogeneity vs. Adjacency: generalising some graph decomposition algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Homogeneity vs. Adjacency: generalising some graph decomposition algorithms will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-69395

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.