Sciweavers

4865 search results - page 129 / 973
» The Complexity of Graph Connectivity
Sort
View
WG
2007
Springer
14 years 4 months ago
The Complexity of Bottleneck Labeled Graph Problems
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Refael Hassin, Jérôme Monnot, Danny S...
WAIM
2010
Springer
13 years 8 months ago
Taming Computational Complexity: Efficient and Parallel SimRank Optimizations on Undirected Graphs
SimRank has been considered as one of the promising link-based ranking algorithms to evaluate similarities of web documents in many modern search engines. In this paper, we investi...
Weiren Yu, Xuemin Lin, Jiajin Le
ISCC
2006
IEEE
127views Communications» more  ISCC 2006»
14 years 4 months ago
Visualizing and Managing Network Topologies via Rectangular Dualization
Rectangular dualization is an effective, hierarchically oriented visualization method for network topologies and can be used in many other problems having in common with networks ...
Massimo Ancona, Walter Cazzola, Sara Drago, Gianlu...
JCT
2006
102views more  JCT 2006»
13 years 10 months ago
Minimal bricks
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick is minimal if for every edge e the deletio...
Serguei Norine, Robin Thomas
CIG
2006
IEEE
14 years 4 months ago
Voronoi game on graphs and its complexity
The Voronoi game is a two-person game which is a model for a competitive facility location. The game is done on a continuous domain, and only two special cases (1-dimensional case ...
Sachio Teramoto, Erik D. Demaine, Ryuhei Uehara