You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output.
Click here to find out more.
Mendeley readers
Chapter title |
An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions
|
---|---|
Chapter number | 23 |
Book title |
SOFSEM 2013: Theory and Practice of Computer Science
|
Published by |
Springer Berlin Heidelberg, January 2013
|
DOI | 10.1007/978-3-642-35843-2_23 |
Book ISBNs |
978-3-64-235842-5, 978-3-64-235843-2
|
Authors |
Mamadou Moustapha Kanté, Christian Laforest, Benjamin Momège |
Editors |
Peter van Emde Boas, Frans C. A. Groen, Giuseppe F. Italiano, Jerzy Nawrocki, Harald Sack |
Mendeley readers
The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 2 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor > Associate Professor | 1 | 50% |
Lecturer | 1 | 50% |
Readers by discipline | Count | As % |
---|---|---|
Mathematics | 1 | 50% |
Agricultural and Biological Sciences | 1 | 50% |