80 search results - page 4 / 16 » Towards an Optimal Algorithm for Recognizing Laman Graphs |
ACL
2010
14 years 8 months ago
2010
Wikipedia articles in different languages are connected by interwiki links that are increasingly being recognized as a valuable source of cross-lingual information. Unfortunately,...
120
click to vote
SAMOS
2004
Springer
15 years 3 months ago
2004
Springer
The dataflow interchange format (DIF) is a textual language that is geared towards capturing the semantics of graphical design tools for DSP system design. A key objective of DIF i...
104
click to vote
MFCS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
102
click to vote
APPROX
2011
Springer
13 years 10 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
LION
2009
Springer
15 years 5 months ago
2009
Springer
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...