Sciweavers

3267 search results - page 16 / 654
» Generalized quasirandom graphs
Sort
View
CPC
2011
219views Education» more  CPC 2011»
13 years 2 months ago
On Percolation and the Bunkbed Conjecture
We study a problem on edge percolation on product graphs G× K2. Here G is any finite graph and K2 consists of two vertices {0, 1} connected by an edge. Every edge in G × K2 is p...
Svante Linusson
ICFP
2012
ACM
11 years 9 months ago
Functional programming with structured graphs
This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit defi...
Bruno C. d. S. Oliveira, William R. Cook
MST
2008
141views more  MST 2008»
13 years 7 months ago
From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
Johann A. Makowsky
ICDCN
2011
Springer
12 years 10 months ago
A High-Level Framework for Distributed Processing of Large-Scale Graphs
Distributed processing of real-world graphs is challenging due to their size and the inherent irregular structure of graph computations. We present HIPG, a distributed framework th...
Elzbieta Krepska, Thilo Kielmann, Wan Fokkink, Hen...
GECCO
2006
Springer
147views Optimization» more  GECCO 2006»
13 years 11 months ago
Generalized cycle crossover for graph partitioning
We propose a new crossover that generalizes cycle crossover to permutations with repetitions and naturally suits partition problems. We tested it on graph partitioning problems ob...
Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon, Byun...