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 |
A Direct Algorithm to Find a Largest Common Connected Induced Subgraph of Two Graphs
|
---|---|
Chapter number | 15 |
Book title |
Graph-Based Representations in Pattern Recognition
|
Published by |
Springer, Berlin, Heidelberg, April 2005
|
DOI | 10.1007/978-3-540-31988-7_15 |
Book ISBNs |
978-3-54-025270-2, 978-3-54-031988-7
|
Authors |
Bertrand Cuissart, Jean-Jacques Hébrard, Cuissart, Bertrand, Hébrard, Jean-Jacques |
Mendeley readers
The data shown below were compiled from readership statistics for 16 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Hungary | 1 | 6% |
Germany | 1 | 6% |
Taiwan | 1 | 6% |
South Africa | 1 | 6% |
Unknown | 12 | 75% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 4 | 25% |
Researcher | 4 | 25% |
Professor > Associate Professor | 2 | 13% |
Student > Doctoral Student | 1 | 6% |
Student > Bachelor | 1 | 6% |
Other | 4 | 25% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 8 | 50% |
Agricultural and Biological Sciences | 3 | 19% |
Engineering | 2 | 13% |
Chemistry | 2 | 13% |
Mathematics | 1 | 6% |
Other | 0 | 0% |