Eulerian Trails and Tours
作者： Mehdi Iranpoor , Davood Mohammaditabar
DOI: 10.4018/978-1-4666-2661-4.CH007
关键词: Eulerian path 、 Computer science
摘要:
sci-hub.st 参考文章(21)
Lloyd Clarke, Ellis Johnson, George Nemhauser, Zhongxi Zhu, THE AIRCRAFT ROTATION PROBLEM. Annals of Operations Research. ,vol. 69, pp. 33- 46 ,(1997) , 10.1023/A:1018945415148
Zaragoza Martinez, Francisco Javier, Postman Problems on Mixed Graphs University of Waterloo. ,(2003)
Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller, Efficient Algorithms for Eulerian Extension Graph Theoretic Concepts in Computer Science. pp. 100- 111 ,(2010) , 10.1007/978-3-642-16926-7_11
Paul Medvedev, Konstantinos Georgiou, Gene Myers, Michael Brudno, Computability of models for sequence assembly workshop on algorithms in bioinformatics. pp. 289- 301 ,(2007) , 10.1007/978-3-540-74126-8_27
Martín Matamala, Eduardo Moreno, Minimum Eulerian circuits and minimum de Bruijn sequences Discrete Mathematics. ,vol. 309, pp. 5298- 5304 ,(2009) , 10.1016/J.DISC.2007.11.027
D. Hauptmeier, S.O. Krumke, J. Rambau, H.-C. Wirth, Euler is standing in line dial-a-ride problems with precedence-constraints workshop on graph theoretic concepts in computer science. ,vol. 113, pp. 87- 107 ,(2001) , 10.1016/S0166-218X(00)00390-5
M. Mihail, P. Winkler, On the number of Eularian orientations of a graph symposium on discrete algorithms. ,vol. 16, pp. 138- 145 ,(1992) , 10.1007/BF01940872
John Wang, Ruiliang Yan, Kimberly Hollister, Dan Zhu, A historic review of management science research in China Omega-international Journal of Management Science. ,vol. 36, pp. 919- 932 ,(2008) , 10.1016/J.OMEGA.2007.10.004
Robert E. Tarjan, Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm Mathematical Programming. ,vol. 78, pp. 169- 177 ,(1997) , 10.1007/BF02614369
Wiebke Höhn, Tobias Jacobs, Nicole Megow, On Eulerian extensions and their application to no-wait flowshop scheduling Journal of Scheduling. ,vol. 15, pp. 295- 309 ,(2012) , 10.1007/S10951-011-0241-1