5889 search results - page 96 / 1178 » Graph Layout Problems |
COCOON
2004
Springer
14 years 3 months ago
2004
Springer
The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...
ECCV
2010
Springer
14 years 3 months ago
2010
Springer
We address the problem of understanding an indoor scene from a single image in terms of recovering the layouts of the faces (floor, ceiling, walls) and furniture. A major challeng...
AUSSOIS
2001
Springer
14 years 2 months ago
2001
Springer
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open prob...
DM
1999
13 years 9 months ago
1999
We introduce some equivalence relations on graphs and posets and prove that they are closed under the cartesian product operation. These relations concern the edge-isoperimetric p...
EVOW
2007
Springer
14 years 4 months ago
2007
Springer
The Steiner Tree Problem (STP) in graphs is a well-known