1101 search results - page 103 / 221 » An Algorithm for the Graph Crossing Number Problem |
165
click to vote
COLOGNETWENTE
2010
15 years 1 months ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
124
click to vote
ASPDAC
2004
ACM
15 years 8 months ago
2004
ACM
- Minimum area is one of the important objectives in technology mapping for lookup table-based FPGAs. It has been proven that the problem is NP-complete. This paper presents a poly...
135
click to vote
SAT
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
142
Voted
ICALP
2000
Springer
15 years 8 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
184
Voted
IMCSIT
2010
15 years 2 months ago
2010
This paper studies the minimum latency broadcast schedule (MLBS) problem in ad hoc networks represented by unit disk graphs. In our approach we use an algorithm, which does not nee...