A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth

Details A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth

2008-06-04

arxiv.org/abs/0806.0840v1

Dans Proceedings of the IEEE International Conference on Automation, Quality and Testing, Robotics. Poster Session. - THETA 16

Computer Science

Data Structures and Algorithms

Scientific paper

In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, but solvable in linear time on this type of graphs. The problems are relevant for assessing network reliability and improving the network's performance and fault tolerance. The main technique considered in this paper is dynamic programming.

Affiliated with

Also associated with

No associations

Rating

A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth 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 Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-154975