Sciweavers

553 search results - page 48 / 111
» Cover Contact Graphs
Sort
View
CORR
2004
Springer
119views Education» more  CORR 2004»
14 years 10 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
EDBT
2006
ACM
174views Database» more  EDBT 2006»
15 years 10 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
ICALP
2007
Springer
15 years 4 months ago
Linear Problem Kernels for NP-Hard Problems on Planar Graphs
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...
Jiong Guo, Rolf Niedermeier
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
15 years 17 days ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
CEAS
2005
Springer
15 years 4 months ago
Comparative Graph Theoretical Characterization of Networks of Spam
Email is an increasingly important and ubiquitous means of communication, both facilitating contact between individuals and enabling rises in the productivity of organizations. Ho...
Luíz Henrique Gomes, Rodrigo B. Almeida, Lu...