553 search results - page 20 / 111 » On Planar Path Transformation |
SIAMCOMP
2008
14 years 11 months ago
2008
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
SIAMDM
2008
14 years 11 months ago
2008
A graph G is strict quasi parity (SQP) if every induced subgraph of G that is not a clique contains a pair of vertices with no odd chordless path between them (an even pair). Houga...
WG
2010
Springer
14 years 10 months ago
2010
Springer
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...
85
Voted
3DPVT
2006
IEEE
15 years 5 months ago
2006
IEEE
This paper presents a method for obtaining accurate dense elevation and appearance models of terrain using a single camera on-board an aerial platform. Applications of this method...
115
click to vote
ESA
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We prove that for every graph H, there exists a polynomial-time algorithm deciding if a planar graph can be contracted to H. We introduce contractions and topological min...