Sciweavers

450 search results - page 90 / 90
» Quadrangulations of Planar Sets
Sort
View
WG
2010
Springer
13 years 4 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
ICCAD
2009
IEEE
106views Hardware» more  ICCAD 2009»
13 years 3 months ago
An efficient pre-assignment routing algorithm for flip-chip designs
The flip-chip package is introduced for modern IC designs with higher integration density and larger I/O counts. In this paper, we consider the pre-assignment flip-chip routing pr...
Po-Wei Lee, Chung-Wei Lin, Yao-Wen Chang, Chin-Fan...
CORR
2011
Springer
197views Education» more  CORR 2011»
13 years 24 days ago
Arrangements of double pseudolines
We define a double pseudoline as a simple closed curve in the open M¨obius band homotopic to the double of its core circle, and we define an arrangement of double pseudolines a...
Luc Habert, Michel Pocchiola
SIAMDM
2010
194views more  SIAMDM 2010»
13 years 16 days ago
Combinatorics and Geometry of Finite and Infinite Squaregraphs
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
Hans-Jürgen Bandelt, Victor Chepoi, David Epp...
ECCC
2010
143views more  ECCC 2010»
13 years 3 months ago
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
Derrick Stolee, N. V. Vinodchandran