Sciweavers

COCOON
2008
Springer
13 years 6 months ago
Efficient Compression of Web Graphs
Yasuhito Asano, Yuya Miyawaki, Takao Nishizeki
COCOON
2008
Springer
13 years 6 months ago
Probe Ptolemaic Graphs
Given a class of graphs, G, a graph G is a probe graph of G if its vertices can be partitioned into two sets, P (the probes) and N (the nonprobes), where N is an independent set, s...
David B. Chandler, Maw-Shang Chang, Ton Kloks, Van...
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
13 years 6 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
CPM
2005
Springer
125views Combinatorics» more  CPM 2005»
13 years 6 months ago
Parametric Analysis for Ungapped Markov Models of Evolution
We present efficient sensitivity-analysis algorithms for two problems involving Markov models of sequence evolution: ancestral reconstruction in evolutionary trees and local ungap...
David Fernández-Baca, Balaji Venkatachalam
COCOON
2005
Springer
13 years 6 months ago
A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...
W. Henry Suters, Faisal N. Abu-Khzam, Yun Zhang, C...
COCOON
2005
Springer
13 years 6 months ago
Solovay Reducibility on D-c.e Real Numbers
A c.e. real x is Solovay reducible to another c.e. real y if x can be approximated at least as efficiently as y by means of increasing computable sequences of rational numbers. The...
Robert Rettinger, Xizhong Zheng
COCOON
2005
Springer
13 years 6 months ago
On-Line Algorithms for Market Equilibria
We consider a variation of the classical problem of finding prices which guarantee equilibrium in linear markets consisting of divisible goods and agents with money. Specificall...
Spyros Angelopoulos, Atish Das Sarma, Avner Magen,...
COCOON
2005
Springer
13 years 6 months ago
On the Power of Lookahead in On-Line Vehicle Routing Problems
d Abstract] Luca Allulli, Giorgio Ausiello, and Luigi Laura Dip. di Informatica e Sistemistica Universit`a di Roma “La Sapienza” Via Salaria, 113 - 00198 Roma Italy.
Luca Allulli, Giorgio Ausiello, Luigi Laura
COCOON
2006
Springer
13 years 6 months ago
Creation and Growth of Components in a Random Hypergraph Process
Denote by an -component a connected b-uniform hypergraph with k edges and k(b - 1) - vertices. We prove that the expected number of creations of -component during a random hypergr...
Vlady Ravelomanana, Alphonse Laza Rijamamy
COCOON
2006
Springer
13 years 6 months ago
Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size
Assume that each vertex of a graph G is assigned a constant number q of nonnegative integer weights, and that q pairs of nonnegative integers li and ui, 1 i q, are given. One wis...
Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishiz...