March 16, 2012 article Open access On the complexity of the Eulerian closed walk with precedence path constraints problem Theoretical Computer Science DOI: 10.1016/j.tcs.2012.03.014 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 1 stored of 2 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access Precedence‐Constrained Shortest Path 2025 Networks article Computer Science Complexity and Algorithms in Graphs Open access 0 citations 1 result References 0