Concepedia

Eulerian Path Algorithms

Eulerian Path Algorithms is a systematic computational method that determines the existence and constructs a path in a graph traversing each edge exactly once, distinguishing it from other graph traversal algorithms by its specific focus on edge coverage and connectivity constraints.

42

Publications

2.5K

Citations

88

Authors

46

Institutions

Publications per year

2017–2026

6

Parents

Publications

42

An Eulerian path approach to DNA fragment assembly

Pavel A. Pevzner, Haixu Tang, Michael S. Waterman · Proceedings of the National Academy of Sciences · 2001 · 1.4K citations · Full text

, , +16

Dynamic trees as search trees via euler tours, applied to the network simplex algorithm

Robert E. Tarjan · Mathematical Programming · 1997 · 107 citations

, , +11

A Simple and Efficient Algorithm for Determining Isomorphism of Planar Triply Connected Graphs

Louis Weinberg · IEEE Transactions on Circuit Theory · 1966 · 91 citations

, , +13

Continuous Eulerian tool path strategies for wire-arc additive manufacturing of rib-web structures with machine-learning-based adaptive void filling

Lam M. Nguyen, Johannes Buhl, Markus Bambach� · Additive manufacturing · 2020 · 79 citations

, , +17

Fault detection and path performance monitoring in meshed all-optical networks

Hongqing Zeng, Changcheng Huang, Alex Vukovic et al. · 2005 · 54 citations

, , +16

1–5 of 42

Authors

88

  1. MS
    Michael S. Waterman

    University of Southern California, United States

    3 publications · 1.5K citations

    3

    h-index

  2. HF
    Herbert Fleischner

    Austrian Academy of Sciences, Austria

    2 publications · 44 citations

    2

    h-index

  3. AŽ
    Arjana Žitnik

    University of Ljubljana, Slovenia

    2 publications · 35 citations

    2

    h-index

  4. LA
    Lars Andersen

    Aalborg University, Denmark

    2 publications · 33 citations

    2

    h-index

  5. PA
    Pavel A. Pevzner

    University of California San Diego, United States

    2 publications · 1.4K citations

    2

    h-index

1–5 of 88

Institutions

46

  1. University of Southern California

    Los Angeles, United States

    4 h-index

    8 publications

    4.4K citations

  2. Xinjiang University

    Ürümqi, China

    3 h-index

    5 publications

    80 citations

  3. Aalborg University

    Aalborg, Denmark

    2 h-index

    2 publications

    33 citations

  4. Xiamen University

    Xiamen, China

    2 h-index

    2 publications

    36 citations

  5. Goldsmiths University of London

    London, United Kingdom

    2 h-index

    2 publications

    30 citations

  6. University of Ljubljana

    Ljubljana, Slovenia

    2 h-index

    3 publications

    57 citations

  7. Stanford University

    Stanford, United States

    1 h-index

    1 publications

    30 citations

  8. University of Waterloo

    Waterloo, Canada

    1 h-index

    1 publications

    16 citations

1–8 of 46

Venues

  1. Discrete Mathematics

    6 publications · 119 citations

    6

    h-index

  2. Discrete Applied Mathematics

    4 publications · 82 citations

    4

    h-index

  3. Proceedings of the National Academy of Sciences

    PNAS · 2 publications · 1.4K citations

    2

    h-index

  4. SIAM Journal on Discrete Mathematics

    2 publications · 38 citations

    2

    h-index

  5. Journal of Computational Biology

    2 publications · 73 citations

    2

    h-index

1–5