Complexity of some Path Problems in DAGs and Linear Orders

14 years 5 months ago

Download personnel.univ-reunion.fr

We investigate here the computational complexity of three natural problems in directed acyclic graphs. We prove their NP Completeness and consider their restrictions to linear orders. Mathematics Subjects Classiﬁcation : .

Serge Burckel

Real-time Traffic

Acyclic Graphs | Computational Complexity | CORR 2007 | Education | NP Completeness |

claim paper

» On unit task linearnonlinear twocluster scheduling problem

» AllPairs Bottleneck Paths in Vertex Weighted Graphs

» Correctorpredictor methods for monotone linear complementarity problems in a wide neighbor...

» NPhardness results for the aggregation of linear orders into median orders

» An optimal shape encoding scheme using skeleton decomposition

» An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem

» PrimalDual Affine Scaling Interior Point Methods for Linear Complementarity Problems

» Streaming Algorithms for Some Problems in LogSpace

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	CORR
Authors	Serge Burckel

Comments (0)

Sciweavers

Complexity of some Path Problems in DAGs and Linear Orders

Acyclic Graphs | Computational Complexity | CORR 2007 | Education | NP Completeness |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers