328 search results - page 10 / 66 » Algorithms for the edge-width of an embedded graph |
SIAMCOMP
1998
13 years 8 months ago
1998
We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe a...
JCT
2010
13 years 7 months ago
2010
In the symmetric group on a set of size 2n, let P2n denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as “pairings”, since each ...
GD
2004
Springer
14 years 2 months ago
2004
Springer
We describe algorithms for drawing media, systems of states, tokens and actions that have state transition graphs in the form of partial cubes. Our algorithms are based on two prin...
EMSOFT
2011
Springer
12 years 8 months ago
2011
Springer
Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent periodic or sporadic tasks. Such a simple task model is not directly applicable to mode...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
Let H be a finite family of graphs. A graph G is H-universal if it contains a copy of each H H as a subgraph. Let H(k, n) denote the family of graphs on n vertices with maximum d...