Sciweavers

1221 search results - page 18 / 245
» Balanced graph partitioning
Sort
View
SSD
2007
Springer
107views Database» more  SSD 2007»
14 years 1 months ago
Spatial Partition Graphs: A Graph Theoretic Model of Maps
The notion of a map is a fundamental metaphor in spatial disciplines. However, there currently exist no adequate data models for maps that define a precise spatial data type for m...
Mark McKenney, Markus Schneider
ARSCOM
2006
140views more  ARSCOM 2006»
13 years 7 months ago
Expansion Properties Of Levi Graphs
ABSTRACT. The Levi graph of a balanced incomplete block design is the bipartite graph whose vertices are the points and blocks of the design, with each block adjacent to those poin...
Dominic Lanphier, C. Miller, Jason Rosenhouse, A. ...
ESA
2008
Springer
142views Algorithms» more  ESA 2008»
13 years 9 months ago
Edge Coloring and Decompositions of Weighted Graphs
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...
Uriel Feige, Mohit Singh
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
13 years 5 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu
COMBINATORICA
2010
13 years 2 months ago
Every rayless graph has an unfriendly partition
We prove that every rayless graph has an unfriendly partition.
Henning Bruhn, Reinhard Diestel, Agelos Georgakopo...