2314 search results - page 183 / 463 » Minimal Partitions of a Graph |
JCT
2007
15 years 4 months ago
2007
We prove results on the size of weakly and strongly separating set systems and matrices, and on cross-intersecting systems. As a consequence, we improve on a result of Katona and ...
115
Voted
IPL
2002
15 years 3 months ago
2002
The barycenter heuristic is often used to solve the NP-hard two-layer edge crossing minimization problem. It is well-known that the barycenter heuristic can give solutions as bad a...
133
click to vote
ADHOCNOW
2004
Springer
15 years 9 months ago
2004
Springer
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
129
click to vote
ICCAD
2000
IEEE
15 years 8 months ago
2000
IEEE
In this paper, we develop a new standard cell placement tool, Dragon2000, to solve large scale placement problem effectively. A top-down hierarchical approach is used in Dragon200...
186
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...