Sciweavers

DAM
2010
66views more  DAM 2010»
13 years 5 months ago
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
Rank-width is a structural graph measure introduced by Oum and Seymour and aimed at better handling of graphs of bounded clique-width. We propose a formal mathematical framework an...
Robert Ganian, Petr Hlinený
DAM
2010
167views more  DAM 2010»
13 years 5 months ago
A new characterization of P6-free graphs
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
Pim van 't Hof, Daniël Paulusma
DAM
2010
83views more  DAM 2010»
13 years 5 months ago
Interlace polynomials: Enumeration, unimodality and connections to codes
The interlace polynomial q was introduced by Arratia, Bollob
Lars Eirik Danielsen, Matthew G. Parker
DAM
2010
101views more  DAM 2010»
13 years 5 months ago
On the distribution of distances between specified nodes in increasing trees
We study the quantity distance between node j and node n in a random tree of size n for increasing tree families. We give closed formul
Markus Kuba, Alois Panholzer
DAM
2010
80views more  DAM 2010»
13 years 5 months ago
On shortest crucial words avoiding abelian powers
Let k 2 be an integer. An abelian k-th power is a word of the form X1X2
Sergey V. Avgustinovich, Amy Glen, Bjarni V. Halld...
DAM
2010
112views more  DAM 2010»
13 years 5 months ago
New results on optimizing rooted triplets consistency
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson
DAM
2010
56views more  DAM 2010»
13 years 5 months ago
Covering and radius-covering arrays: Constructions and classification
Charles J. Colbourn, Gerzson Kéri, P. P. Ri...
DAM
2010
89views more  DAM 2010»
13 years 5 months ago
A note on the hardness of Skolem-type sequences
The purpose of this note is to give upper bounds (assuming P different from NP) on how far the generalizations of Skolem sequences can be taken while still hoping to resolve the ex...
Gustav Nordh
DAM
2010
54views more  DAM 2010»
13 years 5 months ago
An implicit representation of chordal comparability graphs in linear time
Andrew R. Curtis, Clemente Izurieta, Benson L. Joe...
DAM
2010
61views more  DAM 2010»
13 years 5 months ago
A note on the acyclic 3-choosability of some planar graphs
Hervé Hocquard, Mickaël Montassier, An...