Sciweavers

369 search results - page 37 / 74
» Layouts of Graph Subdivisions
Sort
View
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
14 years 2 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan
WG
2010
Springer
13 years 7 months ago
max-cut and Containment Relations in Graphs
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
Marcin Kaminski
VL
2005
IEEE
126views Visual Languages» more  VL 2005»
14 years 2 months ago
Animated Simulation of Integrated UML Behavioral Models Based on Graph Transformation
This paper shows how integrated UML models combining class, object, use-case, collaboration and state diagrams can be animated in a domain-specific layout. The presented approach...
Claudia Ermel, Karsten Hölscher, Sabine Kuske...
FCT
2003
Springer
14 years 1 months ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
ISAAC
2004
Springer
98views Algorithms» more  ISAAC 2004»
14 years 2 months ago
Inner Rectangular Drawings of Plane Graphs
A drawing of a plane graph is called an inner rectangular drawing if every edge is drawn as a horizontal or vertical line segment so that every inner face is a rectangle. An inner ...
Kazuyuki Miura, Hiroki Haga, Takao Nishizeki