90 search results - page 7 / 18 » Connectivity of Graphs Under Edge Flips |
CCCG
2006
13 years 9 months ago
2006
The problem of representing triangulations has been widely studied to obtain convenient encodings and space efficient data structures. In this paper we propose a new practical app...
WG
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each xed...
DIAGRAMS
2004
Springer
14 years 28 days ago
2004
Springer
We describe a method for drawing graph-enhanced Euler diagrams using a three stage method. The first stage is to lay out the underlying Euler diagram using a multicriteria optimizi...
MFCS
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
SPAA
2003
ACM
14 years 23 days ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...