Sciweavers

9532 search results - page 83 / 1907
» Logic, Graphs, and Algorithms
Sort
View
LATIN
1995
Springer
15 years 2 months ago
Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs
A linear-time algorithm for the minimum-ratio spanning tree problem on planar graphs is presented. The algorithm is based on a new planar minimum spanning tree algorithm. The appr...
David Fernández-Baca, Giora Slutzki
SEMWEB
2010
Springer
14 years 9 months ago
Signal/Collect: Graph Algorithms for the (Semantic) Web
The Semantic Web graph is growing at an incredible pace, enabling opportunities to discover new knowledge by interlinking and analyzing previously unconnected data sets. This confr...
Philip Stutz, Abraham Bernstein, William Cohen
ENTCS
2006
117views more  ENTCS 2006»
14 years 11 months ago
Distributed Graph Traversals by Relabelling Systems with Applications
Graph traversals are in the basis of many distributed algorithms. In this paper, we use graph relabelling systems to encode two basic graph traversals which are the broadcast and ...
Bilel Derbel, Mohamed Mosbah
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
15 years 6 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
GBRPR
2005
Springer
15 years 4 months ago
A Direct Algorithm to Find a Largest Common Connected Induced Subgraph of Two Graphs
Abstract. We present a direct algorithm that computes a largest common connected induced subgraph of two given graphs. It is based on an efficient generation of the common connecte...
Bertrand Cuissart, Jean-Jacques Hébrard