6740 search results - page 260 / 1348 » An s -Hamiltonian Line Graph Problem |
113
Voted
SOCO
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Bridging problem domain and solution in product line engineering is a time-consuming and error-prone process. Since both domains are structured differently (features vs....
74
Voted
WSC
1998
15 years 2 months ago
1998
This paper focuses on the practical value of using and selecting rail simulation models to find real solutions to real problems in constrained traffic corridors. It discusses issu...
163
click to vote
ICPR
2010
IEEE
15 years 7 months ago
2010
IEEE
We propose a novel stochastic graph matching algorithm based on data-driven Markov Chain Monte Carlo (DDMCMC) sampling technique. The algorithm explores the solution space efficien...
100
Voted
MFCS
2007
Springer
15 years 7 months ago
2007
Springer
We investigate algorithmic properties of infinite transition graphs that are generated by rewriting systems over unranked trees. Two kinds of such rewriting systems are studied. ...
101
click to vote
WG
2005
Springer
15 years 6 months ago
2005
Springer
In this paper, we consider the recognition problem on the HHDS-free graphs, a class of homogeneously orderable graphs, and we show that it has polynomial time complexity. In partic...