Sciweavers

1605 search results - page 117 / 321
» On Partitional Labelings of Graphs
Sort
View
WDAG
1998
Springer
98views Algorithms» more  WDAG 1998»
14 years 3 months ago
Sense of Direction in Distributed Computing
Sense of direction is a property of labeled graphs which has been shown to have a de
Paola Flocchini, Bernard Mans, Nicola Santoro
ECCV
2002
Springer
15 years 19 days ago
What Energy Functions Can Be Minimized via Graph Cuts?
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
Vladimir Kolmogorov, Ramin Zabih
DIS
2007
Springer
14 years 2 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
FCT
2007
Springer
14 years 2 months ago
Multi-dimensional Packing with Conflicts
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2, . . . , n} with sides s1, s2, . . . , sn [0, 1] and a co...
Leah Epstein, Asaf Levin, Rob van Stee
GD
2008
Springer
13 years 12 months ago
An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
J. Joseph Fowler, Carsten Gutwenger, Michael J&uum...