On some simplicial elimination schemes for chordal graphs

Details On some simplicial elimination schemes for chordal graphs On some simplicial elimination schemes for chordal graphs

2009-01-17

arxiv.org/abs/0901.2645v2

Computer Science

Data Structures and Algorithms

Scientific paper

We present here some results on particular elimination schemes for chordal
graphs, namely we show that for any chordal graph we can construct in linear
time a simplicial elimination scheme starting with a pending maximal clique
attached via a minimal separator maximal (resp. minimal) under inclusion among
all minimal separators.

Affiliated with

Also associated with

No associations

Rating

On some simplicial elimination schemes for chordal graphs 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 On some simplicial elimination schemes for chordal graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On some simplicial elimination schemes for chordal graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-119098