Sciweavers

4865 search results - page 402 / 973
» The Complexity of Graph Connectivity
Sort
View
DAM
2010
60views more  DAM 2010»
15 years 7 months ago
One-to-many node-disjoint paths in (n, k)-star graphs
We present an algorithm which given a source node and a set of n - 1 target nodes in the (n, k)-star graph Sn,k, where all nodes are distinct, builds a collection of n - 1 node-di...
Yonghong Xiang, Iain A. Stewart
EDBT
2008
ACM
150views Database» more  EDBT 2008»
16 years 7 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
CVPR
2005
IEEE
16 years 8 months ago
Asymmetrical Occlusion Handling Using Graph Cut for Multi-View Stereo
Occlusion is usually modelled in two images symmetrically in previous stereo algorithms which cannot work for multi-view stereo efficiently. In this paper, we present a novel form...
Yichen Wei, Long Quan
ICML
2005
IEEE
16 years 7 months ago
Learning from labeled and unlabeled data on a directed graph
We propose a general framework for learning from labeled and unlabeled data on a directed graph in which the structure of the graph including the directionality of the edges is co...
Bernhard Schölkopf, Dengyong Zhou, Jiayuan Hu...
IJCNN
2007
IEEE
16 years 1 months ago
3D-SE Viewer: A Text Mining Tool based on Bipartite Graph Visualization
—A new interactive visualization tool is proposed for textual data mining based on bipartite graph visualization. Applications to three text datasets are presented to show the ca...
Shiro Usui, Antoine Naud, Naonori Ueda, Tatsuki Ta...