Self-stabilizing Algorithms for Connected Vertex Cover and Clique Decomposition Problems
Authors:
- 1 January 2014
- book chapter
- Published by Springer Nature
- p. 307-322
Abstract
No abstract availableKeywords
All Related Versions
This publication has 44 references indexed in Scilit:
- Self-stabilizing Algorithms for Connected Vertex Cover and Clique Decomposition Problems2014
- New Approximation Algorithms for the Vertex Cover Problem2013
- Competitive Self-Stabilizing k-Clustering2012
- The First Fully Polynomial Stabilizing Algorithm for BFS Tree Construction2011
- Brief Announcement: A Stabilizing Algorithm for Finding Two Edge-Disjoint Paths in Arbitrary GraphsLecture Notes in Computer Science, 2011
- A self-stabilizing -clustering algorithm for weighted graphsJournal of Parallel and Distributed Computing, 2010
- Time Optimal Asynchronous Self-stabilizing Spanning TreeLecture Notes in Computer Science, 2007
- Snap-Stabilizing Depth-First Search on Arbitrary NetworksThe Computer Journal, 2005
- Self-Stabilizing Deterministic Network DecompositionJournal of Parallel and Distributed Computing, 2002
- Self-stabilizing depth-first searchInformation Processing Letters, 1994