Results 1  10
of
25
Upgrading Vertices In Trees, SeriesParallel Digraphs And General SeriesParallel Digraphs To Bound Path Length
, 1991
"... We consider trees, seriesparallel digraphs, and general seriesparallel digraphs that have vertex weights and delays. The length/delay of a path is the sum of the delays on the path. We show that minimal weight vertex subsets X such that the length of the longest path is bounded by a given value d ..."
Abstract
 Add to MetaCart
We consider trees, seriesparallel digraphs, and general seriesparallel digraphs that have vertex weights and delays. The length/delay of a path is the sum of the delays on the path. We show that minimal weight vertex subsets X such that the length of the longest path is bounded by a given value d
Linkless symmetric drawings of series parallel digraphs
, 2004
"... In this paper, we present a linear time algorithm for constructing linkless drawings of series parallel digraphs with maximum number of symmetries. Linkless drawing in three dimensions is a natural extension to planar drawing in two dimensions. Symmetry is one of the most important aesthetic criteri ..."
Abstract
 Add to MetaCart
In this paper, we present a linear time algorithm for constructing linkless drawings of series parallel digraphs with maximum number of symmetries. Linkless drawing in three dimensions is a natural extension to planar drawing in two dimensions. Symmetry is one of the most important aesthetic
On Recognition of AndOr SeriesParallel Digraphs
"... The computation task of a distributed processing system usually can be partitioned into a set of modules and then modeled as a directed graph, called the task digraph. In the task digraph, vertices represent modules and arcs represent message passing links between two modules. Particularly, accordin ..."
Abstract
 Add to MetaCart
Or SeriesParallel (AOSP) digraphs. There is a certain probability, called the task reliability , associated with the event that a task completes successfully. This measure accurately models the reliability of a task running in the system. The task reliability problem is known to be NPhard for general
Use of Series Parallel Digraph Analysis in Generating Instructions for Multiple Users
"... Series Parallel (SP) digraphs are a common method of representing instructions with partially ordered actions, but not always an ideal one, as relationships among groups of actions may not be easily noticed when a plan becomes large. Nor are traditional linear textual instructions the best represent ..."
Abstract
 Add to MetaCart
Series Parallel (SP) digraphs are a common method of representing instructions with partially ordered actions, but not always an ideal one, as relationships among groups of actions may not be easily noticed when a plan becomes large. Nor are traditional linear textual instructions the best
Anew Algorithm For Drawing SeriesParallel Graphs In 3D
, 2000
"... This paper proposes a new algorithm for drawing seriesparallel digraphs in three dimensions. Our algorithm produces a three dimensional strictly upward Fary grid drawing with volume O(n³) for an arbitrary seriesparallel digraph. We also prove that if seriesparallel digraph is regular, it ..."
Abstract
 Add to MetaCart
This paper proposes a new algorithm for drawing seriesparallel digraphs in three dimensions. Our algorithm produces a three dimensional strictly upward Fary grid drawing with volume O(n³) for an arbitrary seriesparallel digraph. We also prove that if seriesparallel digraph is regular
A Framework for Dynamic Graph Drawing
 CONGRESSUS NUMERANTIUM
, 1992
"... Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows ..."
Abstract

Cited by 628 (44 self)
 Add to MetaCart
as follows: ffl We devise a model for dynamic graph algorithms, based on performing queries and updates on an implicit representation of the drawing, and we show its applications. ffl We present several efficient dynamic drawing algorithms for trees, seriesparallel digraphs, planar stdigraphs, and planar
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 4 (1 self)
 Add to MetaCart
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.
On maltsev digraphs
 In Computer Science–Theory and Applications
, 2011
"... We study digraphs preserved by a Maltsev operation: Maltsev digraphs. We show that these digraphs retract either onto a directed path or to the disjoint union of directed cycles, showing in this way that the constraint satisfaction problem for Maltsev digraphs is in logspace, L. We then generalize r ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
preserved by a Maltsev operation, and relate them with series parallel digraphs. 1
Homothetic triangle contact representations of planar graphs
 CCCG 2007
, 2007
"... In this paper we study the problem of computing homothetic triangle contact representations of planar graphs. Since not all planar graphs admit such a representation, we concentrate on meaningful subfamilies of planar graphs and prove that: (i) every twoterminal seriesparallel digraph has a homoth ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
In this paper we study the problem of computing homothetic triangle contact representations of planar graphs. Since not all planar graphs admit such a representation, we concentrate on meaningful subfamilies of planar graphs and prove that: (i) every twoterminal seriesparallel digraph has a
Results 1  10
of
25