Back to Results
First PageMeta Content
Route inspection problem / Multigraph / Graph / Line graph / Degree / Directed graph / Clique / Shortest path problem / BEST theorem / Graph theory / NP-complete problems / Eulerian path


Efficient Algorithms for Eulerian Extension and Rural Postman∗ Frederic Dorn† Hannes Moser‡¶ Mathias Weller§k
Add to Reading List

Document Date: 2013-01-23 08:47:12

Open Document

File Size: 202,57 KB

Share Result on Facebook

City

Trondheim / /

Country

Germany / Greece / /

Currency

pence / /

/

IndustryTerm

polynomial-time algorithms / shortest path algorithm / steel manufacturing / flow network / breadth-first search / linear-time algorithm / dynamic programming algorithm / natural applications / /

Organization

Organization of the Paper / Institut f¨ur Informatik / Institut f¨ur Softwaretechnik / /

Person

Yang / Rural Postman / Frederic Dorn† Hannes Moser / Rolf Niedermeier§ January / Cai / Unweighted Variants / Mathias Weller§k Rolf / Hannes Moser‡¶ Mathias / /

Position

General / Corresponding author / /

PublishedMedium

Lecture Notes in Computer Science / /

RadioStation

WMEE / /

Technology

matching-based algorithm / shortest path algorithm / polynomial-time algorithms / 3.2 Algorithms / 3.1 Algorithms / dynamic programming algorithm / linear-time algorithm / /

SocialTag