Sciweavers

2283 search results - page 222 / 457
» Bounds of Graph Characteristics
Sort
View
DM
2008
106views more  DM 2008»
13 years 8 months ago
Chromatic capacity and graph operations
The chromatic capacity cap(G) of a graph G is the largest k for which there exists a k-coloring of the edges of G such that, for every coloring of the vertices of G with the same ...
Jack Huizenga
ALGORITHMICA
2005
149views more  ALGORITHMICA 2005»
13 years 8 months ago
Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
Markus Bläser, Bodo Manthey
CIS
2010
Springer
13 years 3 months ago
Sensor Graphs for Guaranteed Cooperative Localization Performance
A group of mobile robots can localize cooperatively, using relative position and absolute orientation measurements, fused through an extended Kalman filter (ekf). The topology of ...
Y. Yuan, H. G. Tanner
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
12 years 11 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
SIGMOD
2007
ACM
232views Database» more  SIGMOD 2007»
14 years 8 months ago
BLINKS: ranked keyword searches on graphs
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
Haixun Wang, Hao He, Jun Yang 0001, Philip S. Yu