Applied Computing | Sciweavers

26

click to vote

GC
2008
Springer

81views Applied Computing» more GC 2008»

The Fine Intersection Problem for Steiner Triple Systems

13 years 8 months ago

Download www1.spms.ntu.edu.sg

Yeow Meng Chee, Alan C. H. Ling, Hao Shen

claim paper

Read More »

31

click to vote

GC
2008
Springer

143views Applied Computing» more GC 2008»

On the Acyclic Chromatic Number of Hamming Graphs

13 years 8 months ago

Download www.ces.clemson.edu

An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...

Robert E. Jamison, Gretchen L. Matthews

claim paper

Read More »

33

click to vote

GC
2008
Springer

125views Applied Computing» more GC 2008»

Domination in Graphs of Minimum Degree at least Two and Large Girth

13 years 8 months ago

Download www.tu-ilmenau.de

We prove that for graphs of order n, minimum degree 2 and girth g 5 the domination number satisfies 1 3 + 2 3g n. As a corollary this implies that for cubic graphs of order n ...

Christian Löwenstein, Dieter Rautenbach

claim paper

Read More »

29

click to vote

GC
2008
Springer

105views Applied Computing» more GC 2008»

Silver Cubes

13 years 8 months ago

Download people.math.sfu.ca

An n

Mohammad Ghebleh, Luis A. Goddyn, Ebadollah S. Mah...

claim paper

Read More »

30

click to vote

GC
2008
Springer

118views Applied Computing» more GC 2008»

A Bijection for Eulerian-equivalence Classes of Totally Cyclic Orientations

13 years 8 months ago

Download www.combinatorics.net.cn

Gioan showed that the number of cycle reversing classes of totally cyclic orientations of a given graph can be calculated as an evaluation of the corresponding Tutte polynomial. We...

Beifang Chen, Arthur L. B. Yang, Terence Y. J. Zha...

claim paper

Read More »

24

click to vote

GC
2008
Springer

123views Applied Computing» more GC 2008»

Almost Given Length Cycles in Digraphs

13 years 8 months ago

Download www.maths.qmul.ac.uk

For a directed graph G without loops or parallel edges, let (G) denote the size of the smallest feedback arc set, i.e., the smallest subset X E(G) such that G \ X has no directed...

Raphael Yuster

claim paper

Read More »

17

click to vote

GC
2008
Springer

102views Applied Computing» more GC 2008»

On the Ramsey Number of Sparse 3-Graphs

13 years 8 months ago

Download www.math.uni-hamburg.de

Brendan Nagle, Sayaka Olsen, Vojtech Rödl, Ma...

claim paper

Read More »

37

click to vote

COMGEO
2008
ACM

144views Applied Computing» more COMGEO 2008»

Optimal location of transportation devices

13 years 8 months ago

Download www.ulb.ac.be

We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...

Jean Cardinal, Sébastien Collette, Ferran H...

claim paper

Read More »

25

click to vote

COMGEO
2008
ACM

136views Applied Computing» more COMGEO 2008»

Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs

13 years 8 months ago

Download page.mi.fu-berlin.de

We present an algorithm for approximating a given open polygonal curve with a minimum number of circular arcs. In computer-aided manufacturing environments, the paths of cutting t...

Robert L. Scot Drysdale, Günter Rote, Astrid ...

claim paper

Read More »

19

click to vote

COMGEO
2008
ACM

81views Applied Computing» more COMGEO 2008»

I/O-efficient algorithms for computing planar geometric spanners

13 years 8 months ago