Sciweavers

686 search results - page 52 / 138
» Packing Cycles in Graphs
Sort
View
118
Voted
JDA
2010
131views more  JDA 2010»
14 years 11 months ago
Convex drawings of hierarchical planar graphs and clustered planar graphs
: Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, soft...
Seok-Hee Hong, Hiroshi Nagamochi
JCT
2007
118views more  JCT 2007»
15 years 11 days ago
Excluding a planar graph from GF(q)-representable matroids
Abstract. We prove that a binary matroid with huge branchwidth contains the cycle matroid of a large grid as a minor. This implies that an infinite antichain of binary matroids ca...
Jim Geelen, Bert Gerards, Geoff Whittle
ESA
2005
Springer
162views Algorithms» more  ESA 2005»
15 years 6 months ago
Negative Cycle Detection Problem
In this paper, we will describe some heuristics that can be used to improve the runtime of a wide range of commonly used algorithms for the negative cycle detection problem signi...
Chi-Him Wong, Yiu-Cheong Tam
117
Voted
NETWORKS
2007
14 years 12 months ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu
79
Voted
GD
2008
Springer
15 years 1 months ago
Cyclic Leveling of Directed Graphs
Abstract. The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, ...
Christian Bachmaier, Franz-Josef Brandenburg, Wolf...