Sciweavers

42230 search results - page 409 / 8446
» Algorithms and Complexity Results for
Sort
View
ENDM
2010
87views more  ENDM 2010»
15 years 7 months ago
Euler Complexes (Oiks)
We present a class of instances of the existence of a second object of a specified type, in fact, of an even number of objects of a specified type, which generalizes the existence...
Jack Edmonds
IANDC
2010
79views more  IANDC 2010»
15 years 5 months ago
Complexity of deciding bisimilarity between normed BPA and normed BPP
We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a normed BPP process, with running time O(n7 ). This improves the previously known ex...
Petr Jancar, Martin Kot, Zdenek Sawa
191
Voted
COMPGEOM
2010
ACM
15 years 12 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
ICALP
2009
Springer
16 years 7 months ago
Limits and Applications of Group Algebras for Parameterized Problems
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
Ioannis Koutis, Ryan Williams
COMPSAC
2003
IEEE
16 years 4 days ago
Effects of Introducing Survival Behaviours into Automated Negotiators
With the rise of distributed e-commerce in recent years, demand for automated negotiation has increased. In turn, this has facilitated a demand for ever more complex algorithms to...
Peter Henderson, Stephen Crouch, Robert John Walte...