6740 search results - page 310 / 1348 » An s -Hamiltonian Line Graph Problem |
119
click to vote
DCG
2008
15 years 4 months ago
2008
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. Schnyder woods and the face counting approach have important applications in gra...
140
click to vote
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...
120
click to vote
ICCSA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. This paper presents the Job Shop Scheduling Problem (JSSP) represented as the well known Satisfiabilty Problem (SAT). Even though the representation of JSSP in SAT is not...
122
click to vote
ESA
2003
Springer
15 years 9 months ago
2003
Springer
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...
128
click to vote
DIAGRAMS
2006
Springer
15 years 7 months ago
2006
Springer
We conducted eye-tracking studies of subjects solving the problem of finding shortest paths in a graph using a known procedure (Dijkstra's algorithm). The goal of these studie...