Results 1  10
of
12
Planar Orientations with Low OutDegree and Compaction of Adjacency Matrices
 Theoretical Computer Science
, 1991
"... We consider the problem of orienting the edges of a planar graph in such a way that the outdegree of each vertex is minimized. If, for each vertex v, the outdegree is at most d, then we say that such an orientation is dbounded. We prove the following results: ffl Each planar graph has a 5bounde ..."
Abstract

Cited by 48 (4 self)
 Add to MetaCart
We consider the problem of orienting the edges of a planar graph in such a way that the outdegree of each vertex is minimized. If, for each vertex v, the outdegree is at most d, then we say that such an orientation is dbounded. We prove the following results: ffl Each planar graph has a 5bounded acyclic orientation, which can be constructed in linear time. ffl Each planar graph has a 3bounded orientation, which can be constructed in linear time. ffl A 6bounded acyclic orientation, and a 3bounded orientation, of each planar graph can each be constructed in parallel time O(log n log n) on an EREW PRAM, using O(n= log n log n) processors. As an application of these results, we present a data structure such that each entry in the adjacency matrix of a planar graph can be looked up in constant time. The data structure uses linear storage, and can be constructed in linear time. Department of Mathematics and Computer Science, University of California, Riverside, CA 92521. On...
A new algorithm for the recognition of series parallel graphs
 CWI  Centrum voor Wiskunde en Informatica
, 1995
"... In this paper we develop a new lineartime algorithm for the recognition of series parallel graphs. The algorithm is based on a succinct representation of series parallel graphs for which the presence of an arc can be tested in constant time; space utilization is linear in the number of vertices. We ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
(Show Context)
In this paper we develop a new lineartime algorithm for the recognition of series parallel graphs. The algorithm is based on a succinct representation of series parallel graphs for which the presence of an arc can be tested in constant time; space utilization is linear in the number of vertices. We show how to compute such a representation in linear time from a breadthfirst spanning tree. Furthermore, we present a precise condition for the existence of such succinct representations in general, which is, for instance, satisfied by planar graphs.
RealTime Minimum Vertex Cover For TwoTerminal SeriesParallel Graphs
 Proceedings of the Thirteenth Conference on Parallel and Distributed Computing and Systems
, 2000
"... Tree contraction is a powerful technique for solving a large number of graph problems on families of recursively definable graphs. The method is based on processing the parse tree associated with a member of such a family of graphs in a bottomup fashion, such that the solution to the problem is ..."
Abstract

Cited by 7 (7 self)
 Add to MetaCart
(Show Context)
Tree contraction is a powerful technique for solving a large number of graph problems on families of recursively definable graphs. The method is based on processing the parse tree associated with a member of such a family of graphs in a bottomup fashion, such that the solution to the problem is obtained at the root of the tree. Sequentially, this can be done in linear time with respect to the size of the input graph. In parallel, efficient and even cost optimal tree contraction algorithms have also been developed. In this paper we show how the method can be applied to compute the cardinality of the minimum vertex cover of a twoterminal seriesparallel graph. We then construct a realtime paradigm for this problem and show that in the new computational environment, a parallel algorithm is superior to the best possible sequential algorithm, in terms of the accuracy of the solution computed. Specifically, there are cases in which the solution produced by a parallel algorithm ...
Parallel Algorithms for Series Parallel Graphs
 Algorithmica
, 1996
"... In this paper, a parallel algorithm is given that, given a graph G = (V; E), decides whether G is a series parallel graph, and if so, builds a decomposition tree for G of series and parallel composition rules. The algorithm uses O(log E log E) time and O(E) operations on an EREW PRAM, and O(lo ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
(Show Context)
In this paper, a parallel algorithm is given that, given a graph G = (V; E), decides whether G is a series parallel graph, and if so, builds a decomposition tree for G of series and parallel composition rules. The algorithm uses O(log E log E) time and O(E) operations on an EREW PRAM, and O(log E) time and O(E) operations on a CRCW PRAM (note that if G is a simple series parallel graph, then E = O(V)). With the same time and processor resources, a treedecomposition of width at most two can be built of a given series parallel graph, and hence, very efficient parallel algorithms can be found for a large number of graph problems on series parallel graphs, including many well known problems, e.g., all problems that can be stated in monadic second order logic. The results hold for undirected series parallel graphs graphs, as well as for directed series parallel graphs.
Solving Problems on Recursively Constructed Graphs
"... Fast algorithms can be created for many graph problems when instances are confined to classes of graphs that are recursively constructed. This paper first describes some basic conceptual notions regarding the design of such fast algorithms, and then the coverage proceeds through several recursive gr ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Fast algorithms can be created for many graph problems when instances are confined to classes of graphs that are recursively constructed. This paper first describes some basic conceptual notions regarding the design of such fast algorithms, and then the coverage proceeds through several recursive graph classes. Specific classes include kterminal graphs, trees, seriesparallel graphs, ktrees, partial ktrees, Halin graphs, bandwidthk graphs, pathwidthk graphs, treewidthk graphs, branchwidthk graphs, cographs, cliquewidthk graphs, kNLC graphs, kHB graphs, and rankwidthk graphs. The definition of each class is provided, after which some typical algorithms are applied to solve problems on instances of each class.
Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs
 In 26th Workshop on GraphTheoretic Concepts in Computer Science (WG 2000), volume 1928 of Lecture Notes in Computer Science
, 2000
"... In this paper, we present parallel algorithms for the coarse grained multicomputer (CGM) and bulk synchronous parallel computer (BSP) for solving two well known graph problems: (1) determining whether a graph G is bipartite, and (2) determining whether a bipartite graph G is convex. Our algorithms r ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
(Show Context)
In this paper, we present parallel algorithms for the coarse grained multicomputer (CGM) and bulk synchronous parallel computer (BSP) for solving two well known graph problems: (1) determining whether a graph G is bipartite, and (2) determining whether a bipartite graph G is convex. Our algorithms require O(log p) andO(log 2 p) communication rounds, respectively, and linear sequential work per round on a CGM with p processors and N=p local memory per processor, N=jGj. The algorithms assume that N p p for some xed>0, which is true for all commercially available multiprocessors. Our results imply BSP algorithms with O(log p) andO(log 2 p) supersteps, respectively, O(g log(p) N
Explicit Preemption Placement for RealTime Conditional Code
 In: RealTime Systems (ECRTS), 2014 26th Euromicro Conference on. 2014
"... Abstract—In the limitedpreemption scheduling model, tasks cooperate to offer suitable preemption points for reducing the overall preemption overhead. In the fixed preemptionpoint model, tasks are allowed to preempt only at statically defined preemption points, reducing the variability of the pree ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
Abstract—In the limitedpreemption scheduling model, tasks cooperate to offer suitable preemption points for reducing the overall preemption overhead. In the fixed preemptionpoint model, tasks are allowed to preempt only at statically defined preemption points, reducing the variability of the preemption delay and making the system more predictable. Different works have been proposed to determine the optimal selection of preemption points for minimizing the preemption overhead without affecting the system schedulability due to increased nonpreemptivity. However, all works are based on very restrictive task models, without being able to deal with common coding structures like branches, conditional statements and loops. In this work, we overcome this limitation, by proposing a pseudopolynomialtime algorithm that is capable of determining the optimal set of preemption points to minimize the worstcase execution time of jobs represented by control flowgraphs with arbitrarilynested conditional structures, while preserving system schedulability. Exhaustive experiments are included to show that the proposed approach is able to significantly improve the bounds on the worstcase execution times of limited preemptive tasks. Index Terms—limitedpreemption scheduling; fixed preemption points; predictability; graph grammars; dynamic programming. I.
SeriesParallel Automata and Short Regular Expressions
, 2009
"... Computing short regular expressions equivalent to a given finite automaton is a hard task. In this work we present a class of acyclic automata for which it is possible to obtain in time O(n² log n) an equivalent regular expression of size O(n). A characterisation of this class is made using propert ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Computing short regular expressions equivalent to a given finite automaton is a hard task. In this work we present a class of acyclic automata for which it is possible to obtain in time O(n² log n) an equivalent regular expression of size O(n). A characterisation of this class is made using properties of the underlying digraphs that correspond to the seriesparallel digraphs class. Using this characterisation we present an algorithm for the generation of automata of this class and an enumerative formula for the underlying digraphs with a given number of vertices.
Deciding whether graph G has page number one is in NC
 Inform. Process. Lett
, 1992
"... Based on a forbidden subgraph characterization of a graph to have one page, we develop a polylog time algorithm to tell if page number of given graph $G $ is one with polynomial number of processors, clarifying this problem to be in NC. 1 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Based on a forbidden subgraph characterization of a graph to have one page, we develop a polylog time algorithm to tell if page number of given graph $G $ is one with polynomial number of processors, clarifying this problem to be in NC. 1
Path coalitional games
"... Abstract. We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these games, a coalition of edges or vertices is successful if it can enable an st path. We present polynomialtime ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these games, a coalition of edges or vertices is successful if it can enable an st path. We present polynomialtime algorithms to compute and verify least core payoffs of costbased generalizations of path coalitional games and their duals, thereby settling a number of open problems. The least core payoffs of path coalitional games are completely characterized and a polynomialtime algorithm for computing the nucleolus of edge path coalitional games on undirected seriesparallel graphs is presented. 1