2487 search results - page 290 / 498 » Partitions of Graphs into Trees |
114
Voted
PATMOS
2004
Springer
15 years 9 months ago
2004
Springer
Motivated by very/ultra large scale integrated circuit (VLSI/ULSI) physical design applications, we study the construction of rectilinear minimum spanning tree (RMST) with its maxi...
129
Voted
AI
2010
Springer
15 years 3 months ago
2010
Springer
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
118
Voted
ORL
2008
15 years 3 months ago
2008
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
180
click to vote
DISOPT
2011
14 years 7 months ago
2011
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poi...
142
Voted
IROS
2006
IEEE
15 years 9 months ago
2006
IEEE
— This paper describes the use of natural language route descriptions in the mobile robot navigation domain. Guided by corpus analysis and earlier work on coarse qualitative rout...