Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,378,792 papers from all fields of science
Search
Sign In
Create Free Account
Eulerian path
Known as:
Euler walk
, List of impossible figures to redraw
, Eulerian tour
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
30 relations
BEST theorem
Bioinformatics
Bridge (graph theory)
CMOS
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Eulerian properties of hypergraphs
M. A. Bahmanian
,
Mateja vSajna
2016
Corpus ID: 119306239
In this paper we study three substructures in hypergraphs that generalize the notion of an Euler tour in a graph. A flag…
Expand
2009
2009
Design-for-Testability for Digital Microfluidic Biochips
Tao Xu
,
K. Chakrabarty
IEEE VLSI Test Symposium
2009
Corpus ID: 405628
Testing is essential for digital microfluidic biochips that are used for safety-critical applications such as point-of-care…
Expand
2007
2007
Coloring Of Meet-Semilattices
S. K. Nimbhokar
,
M. Wasadikar
,
Lisa Demeyer
Ars Comb.
2007
Corpus ID: 8846433
Given a commutative semigroup S with 0, where 0 is the unique singleton ideal, we associate a simple graph Γ(S), whose vertices…
Expand
Highly Cited
2005
Highly Cited
2005
Defect-oriented testing and diagnosis of digital microfluidics-based biochips
Fei Su
,
William L. Hwang
,
A. Mukherjee
,
K. Chakrabarty
IEEE International Conference on Test, .
2005
Corpus ID: 3187304
Microfluidics-based biochips are soon expected to revolutionize biosensing, clinical diagnostics and drug discovery. Robust off…
Expand
2004
2004
Differentials and differential coefficients in the Eulerian foundations of the calculus
G. Ferraro
2004
Corpus ID: 119918397
2004
2004
A Lagrangian multibody code for deriving the symbolic state-space equations of motion for open-loop systems containing flexible beams
D. Forehand
,
R. Khanin
,
M. Cartmell
Mathematics and Computers in Simulation
2004
Corpus ID: 41934380
2004
2004
Note on Counting Eulerian Circuits
G. Brightwell
,
P. Winkler
arXiv.org
2004
Corpus ID: 3165286
We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P.
2000
2000
Noncommutative Enumeration in Graded Posets
L. Billera
,
Niandong Liu
2000
Corpus ID: 39638584
We define a noncommutative algebra of flag-enumeration functionals on graded posets and show it to be isomorphic to the free…
Expand
1993
1993
Trace Size vs. Parallelism in Trace-and-Replay Debugging of Shared-Memory Programs
Robert H. B. Netzer
International Workshop on Languages and Compilers…
1993
Corpus ID: 10717466
Execution replay is a debugging strategy in which a program is run over and over on an input that manifests bugs. For explicitly…
Expand
1988
1988
Communication-efficient parallel algorithms for distributed random-access machines
C. Leiserson
,
B. Maggs
Algorithmica
1988
Corpus ID: 1865212
This paper introduces a model for parallel computation, called thedistributed randomaccess machine (DRAM), in which the…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE