Sciweavers

77 search results - page 11 / 16
» The Zeta Function of a Hypergraph
Sort
View
RSA
2008
85views more  RSA 2008»
13 years 6 months ago
Quasi-random graphs with given degree sequences
It is now known that many properties of the objects in certain combinatorial structures are equivalent, in the sense that any object possessing any of the properties must of neces...
Fan Chung Graham, Ronald L. Graham
ICALP
2001
Springer
13 years 12 months ago
On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities
We consider the problem of enumerating all minimal integer solutions of a monotone system of linear inequalities. We first show that for any monotone system of r linear inequaliti...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
COMBINATORICS
2006
131views more  COMBINATORICS 2006»
13 years 7 months ago
Encores on Cores
We give a new derivation of the threshold of appearance of the k-core of a random graph. Our method uses a hybrid model obtained from a simple model of random graphs based on rand...
Julie Cain, Nicholas C. Wormald
PODS
2006
ACM
104views Database» more  PODS 2006»
14 years 7 months ago
Tractable database design through bounded treewidth
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...
Georg Gottlob, Reinhard Pichler, Fang Wei
ASPDAC
2000
ACM
159views Hardware» more  ASPDAC 2000»
13 years 11 months ago
Analytical minimization of half-perimeter wirelength
Global placement of hypergraphs is critical in the top-down placement of large timing-driven designs 10, 16 . Placement quality is evaluated in terms of the half-perimeter wirelen...
Andrew A. Kennings, Igor L. Markov