Sciweavers

641 search results - page 46 / 129
» On Planar Quasi-Parity Graphs
Sort
View
WG
2005
Springer
16 years 6 days ago
Channel Assignment and Improper Choosability of Graphs
Abstract. We model a problem proposed by Alcatel, a satellite building company, using improper colourings of graphs. The relation between improper colourings and maximum average de...
Frédéric Havet, Jean-Sébastie...
ICPR
2010
IEEE
15 years 4 months ago
Object Tracking with Ratio Cycles Using Shape and Appearance Cues
We present a method for object tracking over time sequence imagery. The image plane is represented with a 4-connected planar graph where vertices are associated with pixels. On ea...
Mehmet Emre Sargin, Pratim Ghosh, B. S. Manjunath,...
GLVLSI
2006
IEEE
115views VLSI» more  GLVLSI 2006»
16 years 24 days ago
Yield enhancement of asynchronous logic circuits through 3-dimensional integration technology
This paper presents a systematic design methodology for yield enhancement of asynchronous logic circuits using 3-D (3-Dimensional) integration technology. In this design, the targ...
Song Peng, Rajit Manohar
DM
2008
111views more  DM 2008»
15 years 6 months ago
Planarity of iterated line graphs
The line index of a graph G is the smallest k such that the kth iterated line graph of G is nonplanar. We show that the line index of a graph is either in nite or it is at most 4....
Mohammad Ghebleh, Mahdad Khatirinejad
GD
2008
Springer
15 years 7 months ago
An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
J. Joseph Fowler, Carsten Gutwenger, Michael J&uum...