A fast algorithm to remove proper and homogenous pairs of cliques (while preserving some graph invariants)

Details A fast algorithm to remove proper and homogenous pairs of cliques (while preserving some graph invariants) A fast algorithm to remove proper and homogenous pairs of cliques (while preserving some graph invariants)

2011-03-14

arxiv.org/abs/1103.2601v1

Mathematics

Optimization and Control

8 pages

Scientific paper

We introduce a family of reductions for removing proper and homogeneous pairs of cliques from a graph G. This family generalizes some routines presented in the literature, mostly in the context of claw-free graphs. These reductions can be embedded in a simple algorithm that in at most |E(G)| steps builds a new graph G' without proper and homogeneous pairs of cliques, and such that G and G' agree on the value of some relevant invariant (or property).

Affiliated with

Also associated with

No associations

Rating

A fast algorithm to remove proper and homogenous pairs of cliques (while preserving some graph invariants) 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 A fast algorithm to remove proper and homogenous pairs of cliques (while preserving some graph invariants), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A fast algorithm to remove proper and homogenous pairs of cliques (while preserving some graph invariants) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-259083