Sciweavers

3105 search results - page 37 / 621
» The Path-Packing Structure of Graphs
Sort
View
187
Voted
ICDE
2008
IEEE
157views Database» more  ICDE 2008»
16 years 1 months ago
TALE: A Tool for Approximate Large Graph Matching
Abstract-- Large graph datasets are common in many emerging database applications, and most notably in large-scale scientific applications. To fully exploit the wealth of informati...
Yuanyuan Tian, Jignesh M. Patel
EDBT
2012
ACM
257views Database» more  EDBT 2012»
13 years 3 months ago
Indexing and mining topological patterns for drug discovery
Increased availability of large repositories of chemical compounds has created new challenges and opportunities for the application of data-mining and indexing techniques to probl...
Sayan Ranu, Ambuj K. Singh
UAI
2008
15 years 2 months ago
Learning Inclusion-Optimal Chordal Graphs
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
Vincent Auvray, Louis Wehenkel
DAM
2007
82views more  DAM 2007»
15 years 17 days ago
Every toroidal graph without adjacent triangles is (4, 1)*-choosable
In this paper, a structural theorem about toroidal graphs is given that strengthens a result of Borodin on plane graphs. As a consequence, it is proved that every toroidal graph w...
Baogang Xu, Haihui Zhang
103
Voted
GLOBECOM
2010
IEEE
14 years 10 months ago
Range-Key Extension of the Skip Graph
In the Skip Graph, which is a structured overlay network that supports range retrievals, a key is supposed to consist of a single value. Therefore, the Skip Graph cannot perform ra...
Yoshimasa Ishi, Yuuichi Teranishi, Mikio Yoshida, ...