241 search results - page 24 / 49 » Graphs, Hypergraphs and Hashing |
101
click to vote
CPC
2006
15 years 1 months ago
2006
We give results for the age dependent distribution of vertex degree and number of vertices of given degree in the undirected web-graph process, a discrete random graph process int...
109
click to vote
PODS
2006
ACM
16 years 2 months ago
2006
ACM
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...
103
click to vote
GECCO
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...
104
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yu...
124
click to vote
BMCBI
2011
14 years 8 months ago
2011
Background: Standard graphs, where each edge links two nodes, have been extensively used to represent the connectivity of metabolic networks. It is based on this representation th...