686 search results - page 98 / 138 » Packing Cycles in Graphs |
87
Voted
GD
2009
Springer
15 years 5 months ago
2009
Springer
In this paper, we explore a new convention for drawing graphs, the (Manhattan-) geodesic drawing convention. It requires that edges are drawn as interior-disjoint monotone chains o...
92
Voted
CASCON
1997
15 years 2 months ago
1997
Often, software architects impose a particular style on the software systems they design. For large software systems, they would like to ensure that the design continues to confor...
101
Voted
IPL
2008
15 years 19 days ago
2008
A hub set in a graph G is a set U V (G) such that any two vertices outside U are connected by a path whose internal vertices lie in U. We prove that h(G) hc(G) c(G) h(G) + 1, ...
86
Voted
DATE
2008
IEEE
15 years 7 months ago
2008
IEEE
Synchronous Data Flow Graphs (SDFGs) have proved to be a very successful tool for modeling, analysis and synthesis of multimedia applications targeted at both single- and multiproc...
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
Let G = (V, E) be an undirected graph, and let B ⊆ V × V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X â...