Sciweavers

1188 search results - page 137 / 238
» Extended Graph Unification
Sort
View
CSL
2009
Springer
15 years 4 months ago
On the Parameterised Intractability of Monadic Second-Order Logic
One of Courcelle’s celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO2) is fixed-parameter t...
Stephan Kreutzer
ISAAC
2004
Springer
107views Algorithms» more  ISAAC 2004»
15 years 3 months ago
On the Hardness and Easiness of Random 4-SAT Formulas
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
Andreas Goerdt, André Lanka
DATE
2002
IEEE
74views Hardware» more  DATE 2002»
15 years 2 months ago
Maze Routing with Buffer Insertion under Transition Time Constraints
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...
Li-Da Huang, Minghorng Lai, D. F. Wong, Youxin Gao
DBA
2004
93views Database» more  DBA 2004»
14 years 11 months ago
A Query Language Solution for Fastest Flight Connections
This paper discusses how to extend the applicability of the recursive cascade update command of the Xplain query language. This command guarantees termination because cycle detect...
J. A. Bakker, J. H. ter Bekke
ENDM
2007
106views more  ENDM 2007»
14 years 10 months ago
Removing Even Crossings on Surfaces
In this paper we investigate how certain results related to the HananiTutte theorem can be extended from the plane to surfaces. We give a simple topological proof that the weak Ha...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...