A Distributed Algorithm for Computing and Updating the Process Number of a Forest

Authors:
David Coudert;Florian Huc;Dorian Mazauric
Affiliations:
MASCOTTE, INRIA, I3S, CNRS UMR6070, University of Nice Sophia Antipolis, Sophia Antipolis, France;MASCOTTE, INRIA, I3S, CNRS UMR6070, University of Nice Sophia Antipolis, Sophia Antipolis, France;MASCOTTE, INRIA, I3S, CNRS UMR6070, University of Nice Sophia Antipolis, Sophia Antipolis, France
Venue:
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Year:
2008

Citing 5
Cited 3

Searching and pebbling

Theoretical Computer Science
The vertex separation number of a graph equals its path-width

Information Processing Letters
The vertex separation and search number of a graph

Information and Computation
Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time

Journal of Algorithms
An annotated bibliography on guaranteed graph searching

Theoretical Computer Science

A Self-stabilizing Algorithm for Graph Searching in Trees

SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Tradeoffs in process strategy games with application in the WDM reconfiguration problem

FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Efficient self-stabilizing graph searching in tree networks

SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Treewidth and pathwidth have been introduced by Robertson and Seymour as part of the graph minor project. Those parameters are very important since many problems can be solved in polynomial time for graphs with bounded treewidth or pathwidth. By definition, the treewidth of a tree is one, but its pathwidth might be up to log n. A linear time centralized algorithms to compute the pathwidth of a tree has been proposed in [1], but so far no dynamic algorithm exists.