Eulerian path

Known as: Euler walk, List of impossible figures to redraw, Eulerian tour 
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)
Wikipedia

Topic mentions per year

Topic mentions per year

1975-2018
0102019752018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
This paper defines the Stochastic Eulerian Tour Problem (SETP) and investigates several characteristics of this problem. Given an… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2003
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
With the rapid increase in the dataset of genome sequences, the multiple sequence alignment problem is increasingly important and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We consider the problem of patrolling—i.e. ongoing exploration of a network by a decentralized group of simple memoryless robotic… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2001
2001
An amino acid sequence of a protein may be decomposed into consecutive overlapping strings of length K. How unique is the… (More)
  • table I
  • table II
Is this relevant?
2000
2000
The paper describes two algorithms for threading unknown, finite directed Eulerian mazes. Each of these algorithms is performed… (More)
  • table 1
  • table 2
  • figure 1
  • table 3
  • table 4
Is this relevant?
Highly Cited
1997
Highly Cited
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
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
We give efficient randomized schemes to sample and approximately count Eulerian orientations of any Eulerian graph. Eulerian… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?