A Generic Approach for Solving Sparse Path Problems

@inproceedings{Pouly2009AGA,
  title={A Generic Approach for Solving Sparse Path Problems},
  author={Marc Pouly},
  year={2009}
}
This paper shows how sparse path problems can be solved by tree-decomposition techniques. We analyse the properties of closure matrices and prove that they satisfy the axioms of a valuation algebra, which is known to be sufficient for the application of generic tree-decomposition methods. Given a sparse path problem where only a subset of queries are required, we continually compute path weights of smaller graph regions and deduce the total paths from these results. The decisive complexity… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 20 references

Information Algebras

Discrete Mathematics and Theoretical Computer Science • 2003
View 9 Excerpts
Highly Influenced

Algebraic Structures for Transitive Closure

Theor. Comput. Sci. • 1977
View 4 Excerpts
Highly Influenced

Generic Inference

M. Pouly, J. Kohlas
John Wiley & Sons, Inc. • 2010
View 4 Excerpts
Highly Influenced

Graphs, Dioids and Semirings: New Models and Algorithms

M. Gondran, M. Minoux
Operations Research Computer Science Interfaces Series. Springer Publishing Company, Incorporated. • 2008
View 2 Excerpts

Argumentation System and Belief Functions

N. Lehmann
PhD thesis, Department of Informatics, University of Fribourg. • 2001
View 1 Excerpt

Similar Papers

Loading similar papers…