326 search results - page 41 / 66 » A Library of Algorithms for Graph Drawing |
COMPGEOM
2003
ACM
15 years 2 months ago
2003
ACM
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than π). In this paper we prove that the ...
110
click to vote
IV
2003
IEEE
15 years 2 months ago
2003
IEEE
An alternative term for these diagrams is “Euler-Venn diagrams” but they are often inaccurately called “Venn diagrams”. Venn diagrams often look similar, but must contain a...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
TKDE
2002
14 years 9 months ago
2002
In a large-scale information system such as a digital library or the web, a set of distributed caches can improve their effectiveness by coordinating their data placement decisions...
WEA
2010
Springer
15 years 4 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...