Results 1 
9 of
9
Sublogarithmic Distributed MIS Algorithm for Sparse Graphs using NashWilliams Decomposition
 In Journal of Distributed Computing Special Issue of selected papers from PODC
, 2008
"... We study the distributed maximal independent set (henceforth, MIS) problem on sparse graphs. Currently, there are known algorithms with a sublogarithmic running time for this problem on oriented trees and graphs of bounded degrees. We devise the first sublogarithmic algorithm for computing MIS on gr ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
We study the distributed maximal independent set (henceforth, MIS) problem on sparse graphs. Currently, there are known algorithms with a sublogarithmic running time for this problem on oriented trees and graphs of bounded degrees. We devise the first sublogarithmic algorithm for computing MIS on graphs of bounded arboricity. This is a large family of graphs that includes graphs of bounded degree, planar graphs, graphs of bounded genus, graphs of bounded treewidth, graphs that exclude a fixed minor, and many other graphs. We also devise efficient algorithms for coloring graphs from these families. These results are achieved by the following technique that may be of independent interest. Our algorithm starts with computing a certain graphtheoretic structure, called NashWilliams forestsdecomposition. Then this structure is used to compute the MIS or coloring. Our results demonstrate that this methodology is very powerful. Finally, we show nearlytight lower bounds on the running time of any distributed algorithm for computing a forestsdecomposition.
Small InducedUniversal Graphs and Compact Implicit Graph Representations
 In Proc. 43’rd annual IEEE Symp. on Foundations of Computer Science
, 2002
"... We show that there exists a graph G with n 2 nodes, where any forest with n nodes is a nodeinduced subgraph of G. Furthermore, the result implies existence of a graph with n nodes that contains all nnode graphs of fixed arboricity k as nodeinduced subgraphs. We provide a lower bound ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
We show that there exists a graph G with n 2 nodes, where any forest with n nodes is a nodeinduced subgraph of G. Furthermore, the result implies existence of a graph with n nodes that contains all nnode graphs of fixed arboricity k as nodeinduced subgraphs. We provide a lower bound of the size of such a graph. The upper bound is obtained through a simple labeling scheme for parent queries in rooted trees.
Orderly Spanning Trees with Applications
 SIAM Journal on Computing
, 2005
"... Abstract. We introduce and study orderly spanning trees of plane graphs. This algorithmic tool generalizes canonical orderings, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning tree, we provide an algorithm to compute an orderly pair for any c ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
Abstract. We introduce and study orderly spanning trees of plane graphs. This algorithmic tool generalizes canonical orderings, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning tree, we provide an algorithm to compute an orderly pair for any connected planar graph G, consisting of an embedded planar graph H isomorphic to G, and an orderly spanning tree of H. We also present several applications of orderly spanning trees: (1) a new constructive proof for Schnyder’s realizer theorem, (2) the first algorithm for computing an areaoptimal 2visibility drawing of a planar graph, and (3) the most compact known encoding of a planar graph with O(1)time query support. All algorithms in this paper run in linear time.
Dynamic Representations of Sparse Graphs
 In Proc. 6th International Workshop on Algorithms and Data Structures (WADS
, 1999
"... We present a linear space data structure for maintaining graphs with bounded arboricity  a large class of sparse graphs containing e.g. planar graphs and graphs of bounded treewidth  under edge insertions, edge deletions, and adjacency queries. The data structure supports adjacency queries in wors ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
We present a linear space data structure for maintaining graphs with bounded arboricity  a large class of sparse graphs containing e.g. planar graphs and graphs of bounded treewidth  under edge insertions, edge deletions, and adjacency queries. The data structure supports adjacency queries in worst case O(c) time, and edge insertions and edge deletions in amortized O(1) and O(c+log n) time, respectively, where n is the number of nodes in the graph, and c is the bound on the arboricity.
Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
"... Abstract. We deal with the problem of finding such an orientation of a given graph that the largest number of edges leaving a vertex (called the outdegree of the orientation) is small. For any ε ∈ (0, 1) we show an Õ(E(G)/ε) time algorithm3 which finds an orientation of an input graph G with outde ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. We deal with the problem of finding such an orientation of a given graph that the largest number of edges leaving a vertex (called the outdegree of the orientation) is small. For any ε ∈ (0, 1) we show an Õ(E(G)/ε) time algorithm3 which finds an orientation of an input graph G with outdegree at most ⌈(1 + ε)d ∗ ⌉, where d ∗ is the maximum density of a subgraph of G. It is known that the optimal value of orientation outdegree is ⌈d ∗ ⌉. Our algorithm has applications in constructing labeling schemes, introduced by Kannan et al. in [18] and in approximating such graph density measures as arboricity, pseudoarboricity and maximum density. Our results improve over the previous, 2approximation algorithms by Aichholzer et al. [1] (for orientation / pseudoarboricity), by Arikati et al. [3] (for arboricity) and by Charikar [5] (for maximum density). 1
Exercise 23.16 in [6].
, 2000
"... 2: Array initialization Section III.8.1 of [15] contains a description of how a bitvector can be intitialized in worst case constant time. ..."
Abstract
 Add to MetaCart
2: Array initialization Section III.8.1 of [15] contains a description of how a bitvector can be intitialized in worst case constant time.
Literature Notes on Homeworks and the Takehome Exam
, 2000
"... lgorithm Exercise 2 of homework 4 in [13]. Prim's algorithm for computing a minimum spanning tree is, e.g., described in Section 24.2 of [6]. 5: The Stable Marriage Problem Exercise 1 of homework 6 in [13]. Gale and Shapley were the rst to investigate the stable marriage problem and gave an O(n ..."
Abstract
 Add to MetaCart
lgorithm Exercise 2 of homework 4 in [13]. Prim's algorithm for computing a minimum spanning tree is, e.g., described in Section 24.2 of [6]. 5: The Stable Marriage Problem Exercise 1 of homework 6 in [13]. Gale and Shapley were the rst to investigate the stable marriage problem and gave an O(n 2 ) solution in [8]. 1 Algorithms January 17, 2000 Homework 3 1: Minimum Spanning Trees A linear time algorithm for nding a minimum spanning tree for planar graph was rst given in [5]. The O(m log n) time algorithm for nding a minimum spanning tree in a general graph was described in [7]the paper introducing Fibonacci heaps. The current best dertministic minimum spanning tree algorithms use time O(m(m;n)), where is an inverse of Ackerman's function [4, 17]. A randomized
Literature Notes on Homeworks
, 2001
"... cise 2 of homework 4 in [13]. Prim's algorithm for computing a minimum spanning tree is, e.g., described in Section 24.2 of [6]. 5: The Stable Marriage Problem Exercise 1 of homework 6 in [13]. Gale and Shapley were the rst to investigate the stable marriage problem and gave an O(n 2 ) solution ..."
Abstract
 Add to MetaCart
cise 2 of homework 4 in [13]. Prim's algorithm for computing a minimum spanning tree is, e.g., described in Section 24.2 of [6]. 5: The Stable Marriage Problem Exercise 1 of homework 6 in [13]. Gale and Shapley were the rst to investigate the stable marriage problem and gave an O(n 2 ) solution in [8]. 1 Algorithms February 13, 2001 Homework 3 1: Minimum Spanning Trees A linear time algorithm for nding a minimum spanning tree for planar graph was rst given in [5]. The O(m log n) time algorithm for nding a minimum spanning tree in a general graph was described in [7]the paper introducing Fibonacci heaps. The current best dertministic minimum spanning tree algorithms use time O(m(m;n)), where is an inverse of Ackerman's function [4, 17]. A randomized linear time algorit
Orderly Spanning Trees with Applications ∗
, 2008
"... We introduce and study the orderly spanning trees of plane graphs. This algorithmic tool generalizes canonical orderings, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning tree, we provide an algorithm to compute an orderly pair for any connect ..."
Abstract
 Add to MetaCart
We introduce and study the orderly spanning trees of plane graphs. This algorithmic tool generalizes canonical orderings, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning tree, we provide an algorithm to compute an orderly pair for any connected planar graph G, consisting of a plane graph H of G, and an orderly spanning tree of H. We also present several applications of orderly spanning trees: (1) a new constructive proof for Schnyder’s Realizer Theorem, (2) the first areaoptimal 2visibility drawing of G, and (3) the best known encodings of G with O(1)time query support. All algorithms in this paper run in linear time. 1