# 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

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 21 REFERENCES

## Path Problems in Graphs

VIEW 1 EXCERPT

## Complexity of finding embeddings in a k -tree

VIEW 1 EXCERPT

## Regular Algebra Applied to Path-finding Problems

VIEW 2 EXCERPTS

## A generic framework for local computation

VIEW 3 EXCERPTS

## Bucket Elimination: A Unifying Framework for Reasoning

VIEW 1 EXCERPT

## Axioms for probability and belief-function proagation

VIEW 1 EXCERPT

## Algebraic Structures for Transitive Closure

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## Constraint Processing

VIEW 1 EXCERPT