1963 search results - page 125 / 393 » The Maximum Solution Problem on Graphs |
JGT
2007
13 years 10 months ago
2007
A well-known theorem of Mader [5] states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. Solving a problem of Diestel [2], we ex...
MICS
2010
13 years 4 months ago
2010
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
CVPR
2005
IEEE
15 years 2 days ago
2005
IEEE
We present a surprisingly simple system that allows for robust normal reconstruction by dense photometric stereo, in the presence of severe shadows, highlight, transparencies, com...
STACS
2004
Springer
14 years 3 months ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
ESA
2001
Springer
14 years 2 months ago
2001
Springer
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admittin...