Publication | Closed Access
I/O-efficient algorithms for graphs of bounded treewidth
25
Citations
25
References
2001
Year
Mathematical ProgrammingDirected GraphBounded TreewidthI/o-efficient AlgorithmsEngineeringPlanar GraphNetwork AnalysisEducationComputational ComplexityStructural Graph TheoryDiscrete MathematicsCombinatorial OptimizationGraph AlgorithmsPresent I/o-efficient AlgorithmsComputer ScienceNp-hard ProblemsGraph AlgorithmGraph MinorNetwork AlgorithmGraph TheoryParallel Programming
We present I/O-efficient algorithms for the single source shortest path problem and NP-hard problems on graphs of bounded treewidth. The main step in these algorithms is a method to compute a tree-decomposition for the given graph I/O-efficiently.
| Year | Citations | |
|---|---|---|
Page 1
Page 1