Some Probabilistic Results on Width Measures of Graphs

Details Some Probabilistic Results on Width Measures of Graphs Some Probabilistic Results on Width Measures of Graphs

2009-08-12

arxiv.org/abs/0908.1772v5

Mathematics

Combinatorics

Hopefully free of major issues

Scientific paper

Fixed parameter tractable (FPT) algorithms run in time f(p(x)) poly(|x|), where f is an arbitrary function of some parameter p of the input x and poly is some polynomial function. Treewidth, branchwidth, cliquewidth, NLC-width, rankwidth, and booleanwidth are parameters often used in the design and analysis of such algorithms for problems on graphs. We show asymptotically almost surely (aas), there are Omega(n) lower bounds on the treewidth, branchwidth, cliquewidth, NLC-width, and rankwidth of graphs drawn from a simple random model. This raises important questions about the generality of FPT algorithms using the corresponding decompositions.

Affiliated with

Also associated with

No associations

Rating

Some Probabilistic Results on Width Measures of 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 Some Probabilistic Results on Width Measures of Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some Probabilistic Results on Width Measures of Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-371197