96 search results - page 9 / 20 » Algorithm Engineering for Optimal Graph Bipartization |
ICCAD
1999
IEEE
14 years 5 days ago
1999
IEEE
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
WEA
2010
Springer
14 years 1 months ago
2010
Springer
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
TCOM
2010
13 years 2 months ago
2010
Abstract--This paper considers the problem of optimal subcarrier allocation in OFDMA systems to achieve the minimum outage probability while guaranteeing fairness. The optimal subc...
KBSE
2003
IEEE
14 years 1 months ago
2003
IEEE
We propose a practical parallel on-the-fly algorithm for enumerative LTL model-checking. The algorithm is designed for a cluster of workstations communicating via MPI. The detect...