Sciweavers

9532 search results - page 378 / 1907
» Logic, Graphs, and Algorithms
Sort
View
AAAI
2006
15 years 8 months ago
Domain-Independent Structured Duplicate Detection
The scalability of graph-search algorithms can be greatly extended by using external memory, such as disk, to store generated nodes. We consider structured duplicate detection, an...
Rong Zhou, Eric A. Hansen
SIAMDM
2008
190views more  SIAMDM 2008»
15 years 6 months ago
On the Complexity of Ordered Colorings
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
Arvind Gupta, Jan van den Heuvel, Ján Manuc...
JGAA
2000
89views more  JGAA 2000»
15 years 6 months ago
Dynamic WWW Structures in 3D
We describe a method for three-dimensional straight-line representation of dynamic directed graphs (such as parts of the World Wide Web). It has been developed on the occasion of ...
Ulrik Brandes, Vanessa Kääb, Andres L&ou...
KDD
2004
ACM
114views Data Mining» more  KDD 2004»
16 years 7 months ago
Scalable mining of large disk-based graph databases
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...
Chen Wang, Wei Wang 0009, Jian Pei, Yongtai Zhu, B...
JDA
2006
87views more  JDA 2006»
15 years 6 months ago
A 3-approximation for the pathwidth of Halin graphs
We prove that the pathwidth of Halin graphs can be 3-approximated in linear time. Our approximation algorithms is based on a combinatorial result about respectful edge orderings o...
Fedor V. Fomin, Dimitrios M. Thilikos