Sciweavers

1370 search results - page 38 / 274
» On grids in topological graphs
Sort
View
JCT
2007
118views more  JCT 2007»
13 years 8 months 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
CORR
2010
Springer
73views Education» more  CORR 2010»
13 years 8 months ago
On Touching Triangle Graphs
Abstract. In this paper, we consider the problem of representing graphs by triangles whose sides touch. We present linear time algorithms for creating touching triangles representa...
Emden R. Gansner, Yifan Hu, Stephen G. Kobourov
TVCG
2010
152views more  TVCG 2010»
13 years 6 months ago
On the Fractal Dimension of Isosurfaces
—A (3D) scalar grid is a regular n1 × n2 × n3 grid of vertices where each vertex v is associated with some scalar value sv. Applying trilinear interpolation, the scalar grid de...
Marc Khoury, Rephael Wenger
INFOCOM
2002
IEEE
14 years 1 months ago
On Distinguishing between Internet Power Law Topology Generators
— Recent work has shown that the node degree in the WWW induced graph and the AS-level Internet topology exhibit power laws. Since then several algorithms have been proposed to g...
Tian Bu, Donald F. Towsley
MASCOTS
2003
13 years 10 months ago
Toward Scaling Network Emulation using Topology Partitioning
Scalability is the primary challenge to studying large complex network systems with network emulation. This paper studies topology partitioning, assigning disjoint pieces of the n...
Ken Yocum, Ethan Eade, Julius Degesys, David Becke...