6740 search results - page 130 / 1348 » An s -Hamiltonian Line Graph Problem |
145
click to vote
HICSS
2009
IEEE
15 years 10 months ago
2009
IEEE
The idea to develop applications and infrastructure software as software product lines (SPLs) is continuously growing in acceptance throughout the software industry. The ability t...
122
click to vote
ASIAMS
2007
IEEE
15 years 9 months ago
2007
IEEE
This paper introduces a modified version of the well known global optimization technique named line search method. The modifications refer to the way in which the direction and th...
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Abstract. We consider the line planning problem in public transportation, under a robustness perspective. We present a mechanism for robust line planning in the case of multiple li...
104
click to vote
DM
2008
15 years 3 months ago
2008
We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algor...
105
click to vote
STOC
1993
ACM
15 years 7 months ago
1993
ACM
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...