DAM 2007 | Sciweavers

15

click to vote

DAM
2007

47views more DAM 2007»

Tutte sets in graphs II: The complexity of finding maximum Tutte sets

13 years 11 months ago

Download www.dur.ac.uk

Douglas Bauer, Hajo Broersma, Nathan Kahl, Aurora ...

claim paper

Read More »

32

click to vote

DAM
2007

153views more DAM 2007»

Computing the minimum number of hybridization events for a consistent evolutionary history

13 years 11 months ago

Download www.dur.ac.uk

It is now well-documented that the structure of evolutionary relationships between a set of present-day species is not necessarily tree-like. The reason for this is that reticulat...

Magnus Bordewich, Charles Semple

claim paper

Read More »

27

click to vote

DAM
2007

76views more DAM 2007»

Super-simple (v, 5, 4) designs

13 years 11 months ago

Download peace.lakeheadu.ca

Super-simple designs are useful in constructing codes and designs such as superimposed codes and perfect hash families. Recently, Gronau et al determined the existence of super-si...

Kejun Chen, Ruizhong Wei

claim paper

Read More »

30

click to vote

DAM
2007

81views more DAM 2007»

Graphs, partitions and Fibonacci numbers

13 years 11 months ago

Download finanz.math.tu-graz.ac.at

The Fibonacci number of a graph is the number of independent vertex subsets. In this paper, we investigate trees with large Fibonacci number. In particular, we show that all trees...

Arnold Knopfmacher, Robert F. Tichy, Stephan Wagne...

claim paper

Read More »

39

click to vote

DAM
2007

97views more DAM 2007»

On Sturmian graphs

13 years 11 months ago

Download dipmat.math.unipa.it

In this paper we deﬁne Sturmian graphs and we prove that all of them have a certain “counting” property. We show deep connections between this counting property and two conj...

Chiara Epifanio, Filippo Mignosi, Jeffrey Shallit,...

claim paper

Read More »

34

click to vote

DAM
2007

74views more DAM 2007»

On the uniform edge-partition of a tree

13 years 11 months ago

Download www.csie.ntu.edu.tw

We study the problem of uniformly partitioning the edge set of a tree with n edges into k connected components, where k ≤ n. The objective is to minimize the ratio of the maximu...

Bang Ye Wu, Hung-Lung Wang, Shih Ta Kuan, Kun-Mao ...

claim paper

Read More »

33

click to vote

DAM
2007

100views more DAM 2007»

Partially ordered knapsack and applications to scheduling

13 years 11 months ago

Download cgi.di.uoa.gr

In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...

Stavros G. Kolliopoulos, George Steiner

claim paper

Read More »

37

click to vote

DAM
2007

70views more DAM 2007»

Tree-edges deletion problems with bounded diameter obstruction sets

13 years 11 months ago

Download cs.haifa.ac.il

We study the following problem: Given a tree G and a ﬁnite set of trees H, ﬁnd a subset O of the edges of G such that G − O does not contain a subtree isomorphic to a tree f...

Dekel Tsur

claim paper

Read More »

14

click to vote

DAM
2007

41views more DAM 2007»

Distance-two labelings of digraphs

13 years 11 months ago

Download www.math.ntu.edu.tw

Gerard J. Chang, Jer-Jeong Chen, David Kuo, Sheng-...

claim paper