441 search results - page 24 / 89 » Convex Graph Invariants |
SOFSEM
2005
Springer
14 years 1 months ago
2005
Springer
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one s...
TCS
2010
13 years 2 months ago
2010
In this paper we show that the problem of finding a chordless path between a vertex s and a vertex t containing a vertex v remains NP-complete in bipartite graphs, thereby strengt...
DM
2008
13 years 7 months ago
2008
A triangular grid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional triangular grid. In 2000, Reay and Zamfirescu showed that all 2-conne...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
In video surveillance, the size of face images is very small. However, few works have been done to investigate scale invariant face recognition. Our experiments on appearance-base...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...