6740 search results - page 43 / 1348 » An s -Hamiltonian Line Graph Problem |
133
Voted
CONTEXT
2003
Springer
15 years 10 months ago
2003
Springer
This paper discusses the dynamic of context through the use of a context-based formalism called contextual graphs that has been initially developed in the SART application for the ...
214
Voted
SOICT
2010
14 years 11 months ago
2010
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
184
click to vote
COMPGEOM
1992
ACM
15 years 9 months ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
144
Voted
EVOW
2005
Springer
15 years 10 months ago
2005
Springer
This paper describes a new Ant Colony Optimization (ACO) algorithm for solving Graph Matching Problems, the goal of which is to find the best matching between vertices of multi-la...
124
Voted
JCT
2007
15 years 4 months ago
2007
We describe a general construction principle for a class of self-similar graphs. For various enumeration problems, we show that this construction leads to polynomial systems of rec...