Sciweavers

236 search results - page 11 / 48
» Graphs, partitions and Fibonacci numbers
Sort
View
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
15 years 4 months ago
Boosting Spectral Partitioning by Sampling and Iteration
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
Joachim Giesen, Dieter Mitsche
JCT
2008
103views more  JCT 2008»
14 years 11 months ago
A bijective proof of Jackson's formula for the number of factorizations of a cycle
Factorizations of the cyclic permutation (1 2 . . . N) into two permutations with respectively n and m cycles, or, equivalently, unicellular bicolored maps with N edges and n whit...
Gilles Schaeffer, Ekaterina A. Vassilieva
PAKDD
2004
ACM
183views Data Mining» more  PAKDD 2004»
15 years 4 months ago
Constraint-Based Graph Clustering through Node Sequencing and Partitioning
This paper proposes a two-step graph partitioning method to discover constrained clusters with an objective function that follows the well-known minmax clustering principle. Compar...
Yu Qian, Kang Zhang, Wei Lai
ICRA
2006
IEEE
134views Robotics» more  ICRA 2006»
15 years 5 months ago
Hierarchical Map Building and Planning based on Graph Partitioning
— Mobile robot localization and navigation requires a map - the robot’s internal representation of the environment. A common problem is that path planning becomes very ineffic...
Zoran Zivkovic, Bram Bakker, Ben J. A. Kröse
COMBINATORICA
2006
125views more  COMBINATORICA 2006»
14 years 11 months ago
Coloring Subgraphs of the Rado Graph
Given a universal binary countable homogeneous structure U and n , there is a partition of the induced n-element substructures of U into finitely many classes so that for any par...
Norbert W. Sauer