Route inspection problem - PDFSEARCH.IO - Document Search Engine

Route inspection problem
Results: 11

#	Item
1	43 Documenta Math. ¨ nigsberg, Euler, Mei-Ko Kwan, Ko Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2012-07-25 10:24:40 Graph theory NP-complete problems Eulerian path Route inspection problem Cycle Degree Leonhard Euler Matching Seven Bridges of Knigsberg 2-factor theorem
2	43 Documenta Math. ¨ nigsberg, Euler, Mei-Ko Kwan, Ko Add to Reading List Source URL: documenta.sagemath.org Language: English - Date: 2012-07-25 10:24:40 Graph theory NP-complete problems Eulerian path Route inspection problem Cycle Degree Leonhard Euler Matching Seven Bridges of Knigsberg 2-factor theorem
3	Counting Eulerian Circuits is #P-Complete Graham R. Brightwell Abstract We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P. The method employed is mod Add to Reading List Source URL: www.siam.org Language: English - Date: 2005-07-06 08:19:12 Eulerian path NP-complete problems BEST theorem Degree Connectivity Hamiltonian path Tree Graph Route inspection problem Graph theory Mathematics Theoretical computer science
4	´ Quebec, ´ CCCG 2008, Montreal, August 13–15, 2008 Computational Balloon Twisting: Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:01:20 Eulerian path Route inspection problem Graph Matching Line graph Hamiltonian path Graph theory Planar graphs NP-complete problems
5	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 The Embroidery Problem Esther M. Arkin∗ George W. Hart† Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:07:19 NP-complete problems Combinatorial optimization Graph connectivity Matching Steiner tree problem Minimum spanning tree Eulerian path Route inspection problem Cut Graph theory Theoretical computer science Mathematics
6	Computational Balloon Twisting: The Theory of Balloon Polyhedra Erik D. Demaine∗ Martin L. Demaine∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:08:28 Polyhedron Octahedron Eulerian path Induced path Matching Route inspection problem Line graph Edge coloring Graph theory Planar graphs NP-complete problems
7	Efficient Algorithms for Eulerian Extension and Rural Postman∗ Frederic Dorn† Hannes Moser‡¶ Mathias Weller§k Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-01-23 08:47:12 Route inspection problem Multigraph Graph Line graph Degree Directed graph Clique Shortest path problem BEST theorem Graph theory NP-complete problems Eulerian path
8	CHAPTER 3 Chinese postman problem Learning objectives Add to Reading List Source URL: ie454.cankaya.edu.tr Language: English - Date: 2010-04-13 11:18:18 Eulerian path Graph Handshaking lemma Tree Vertex Cycle graph Line graph Graph theory Mathematics Route inspection problem
9	J Sched[removed]:295–309 DOI[removed]s10951[removed]On Eulerian extensions and their application to no-wait flowshop scheduling Wiebke Höhn · Tobias Jacobs · Nicole Megow Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-05-07 06:57:04 NP-complete problems Operations research Eulerian path Route inspection problem Degree Travelling salesman problem Directed graph Job shop scheduling Graph Theoretical computer science Graph theory Mathematics
10	Undirected Graphs and Networks Networks and graphs A network is a collection of objects connected to each other in some specific way. A graph is a finite set of dots called vertices (or nodes) connected by links called e Add to Reading List Source URL: www.di-mgt.com.au Language: English - Date: 2003-09-21 13:50:00 Graph connectivity Graph coloring Hamiltonian path Eulerian path Path Graph Spanning tree Tree Route inspection problem Graph theory Theoretical computer science NP-complete problems