Sciweavers

263 search results - page 2 / 53
» On the Containment of Forbidden Patterns Problems
Sort
View
COMBINATORICS
2007
72views more  COMBINATORICS 2007»
13 years 5 months ago
Matrix Partitions with Finitely Many Obstructions
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
Tomás Feder, Pavol Hell, Wing Xie
CSCLP
2007
Springer
13 years 11 months ago
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
Yves Deville, Grégoire Dooms, Stépha...
CIKM
2008
Springer
13 years 7 months ago
A heuristic approach for checking containment of generalized tree-pattern queries
Query processing techniques for XML data have focused mainly on tree-pattern queries (TPQs). However, the need for querying XML data sources whose structure is very complex or not...
Pawel Placek, Dimitri Theodoratos, Stefanos Soulda...
CORR
2007
Springer
148views Education» more  CORR 2007»
13 years 5 months ago
Linear time algorithms for Clobber
We prove that the single-player game clobber is solvable in linear time when played on a line or on a cycle. For this purpose, we show that this game is equivalent to an optimizat...
Vincent D. Blondel, Julien M. Hendrickx, Raphael M...
WSC
2008
13 years 7 months ago
Yard crane dispatching based on real time data driven simulation for container terminals
This paper studies the problem of real time yard crane dispatching in container terminals. Many technologies, including transponders, RFID and GPS have been used in the container ...
Xi Guo, Shell-Ying Huang, Wen-Jing Hsu, Malcolm Yo...