In graph theory, an Eulerian trail (or Eulerian path) is a trail in a graph which visits every edge exactly once. Similarly, an Eulerian circuit or… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2008

2008

- Srimathy Mohan, Michel Gendreau, Jean-Marc Rousseau
- Transportation Science
- 2008

This paper defines the Stochastic Eulerian Tour Problem (SETP) and investigates several characteristics of this problem. Given an… (More)

Is this relevant?

2003

2003

- Michael S. Waterman, Yu Zhang
- CSB
- 2003

With the rapid increase in the size of genome sequence databases, the multiple sequence alignment problem is increasingly… (More)

Is this relevant?

2003

2003

- Yu Zhang, Michael S. Waterman
- Journal of Computational Biology
- 2003

With the rapid increase in the dataset of genome sequences, the multiple sequence alignment problem is increasingly important and… (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Vladimir Yanovski, Israel A. Wagner, Alfred M. Bruckstein
- Algorithmica
- 2003

We consider the problem of patrolling—i.e. ongoing exploration of a network by a decentralized group of simple memoryless robotic… (More)

Is this relevant?

2001

2001

- Bailin Hao, Huimin Xie, Shuyu Zhang
- 2001

An amino acid sequence of a protein may be decomposed into consecutive overlapping strings of length K. How unique is the… (More)

Is this relevant?

2000

2000

- Sandeep N. Bhatt, Shimon Even, David S. Greenberg, Rafi Tayar
- J. Graph Algorithms Appl.
- 2000

The paper describes two algorithms for threading unknown, finite directed Eulerian mazes. Each of these algorithms is performed… (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Edson Cáceres, Frank Dehne, +5 authors Siang Wun Song
- Algorithmica
- 1997

In this paper we present deterministic parallel algorithms for the coarse-grained multicomputer (CGM) and bulk synchronous… (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Jon M. Kleinberg, Éva Tardos
- FOCS
- 1995

We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to… (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- Milena Mihail, Peter Winkler
- Algorithmica
- 1992

We give efficient randomized schemes to sample and approximately count Eulerian orientations of any Eulerian graph. Eulerian… (More)

Is this relevant?

Highly Cited

1982