3008 search results - page 172 / 602 » Independence in connected graphs |
151
click to vote
ISPD
1999
ACM
15 years 10 months ago
1999
ACM
—Maze routing algorithms are widely used for finding an optimal path in detailed routing for very large scale integration, printed circuit board and multichip modules In this pap...
155
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite, unknown connected graph or in an unknown connected terrain in the plane. Agents ar...
151
click to vote
DCG
2008
15 years 6 months ago
2008
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. Schnyder woods and the face counting approach have important applications in gra...
140
click to vote
DM
2006
15 years 6 months ago
2006
Given a 3-connected biased graph with three node-disjoint unbalanced circles, at most one of which is a loop, we describe how the bias matroid of is uniquely represented by .
201
click to vote
BIRTHDAY
2010
Springer
15 years 7 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...