Sciweavers

36781 search results - page 41 / 7357
» Parameterizing by the Number of Numbers
Sort
View
ISBRA
2010
Springer
14 years 4 months ago
Fast Computation of the Exact Hybridization Number of Two Phylogenetic Trees
Abstract. Hybridization is a reticulate evolutionary process. An established problem on hybridization is computing the minimum number of hybridization events, called the hybridizat...
Yufeng Wu, Jiayin Wang
SWAT
2010
Springer
260views Algorithms» more  SWAT 2010»
14 years 3 months ago
Isomorphism for Graphs of Bounded Feedback Vertex Set Number
This paper presents an O(n2 ) algorithm for deciding isomorphism of graphs that have bounded feedback vertex set number. This number is defined as the minimum number of vertex de...
Stefan Kratsch, Pascal Schweitzer
MMB
2010
Springer
185views Communications» more  MMB 2010»
14 years 1 days ago
Reducing the Cost of Generating APH-Distributed Random Numbers
Phase-type (PH) distributions are proven to be very powerful tools in modelling and analysis of a wide range of phenomena in computer systems. The use of these distributions in sim...
Philipp Reinecke, Miklós Telek, Katinka Wol...
DRR
2008
13 years 11 months ago
Versatile page numbering analysis
In this paper, we revisit the problem of detecting the page numbers of a document. This work is motivated by a need for a generic method which applies on a large variety of docume...
Hervé Déjean, Jean-Luc Meunier
COMBINATORICS
2006
132views more  COMBINATORICS 2006»
13 years 10 months ago
On Computing the Distinguishing Numbers of Trees and Forests
Let G be a graph. A vertex labeling of G is distinguishing if the only label-preserving automorphism of G is the identity map. The distinguishing number of G, D(G), is the minimum...
Christine T. Cheng