Dr George Mertzios george.mertzios@durham.ac.uk
Associate Professor
The friendship problem on graphs
Mertzios, G.B.; Unger, W.
Authors
W. Unger
Citation
Mertzios, G., & Unger, W. (2008, May). The friendship problem on graphs. Presented at 1st International Conference on Relations, Orders and Graphs : Interaction with Computer Science (ROGICS), Mahdia, Tunisia
| Presentation Conference Type | Conference Paper (published) |
|---|---|
| Conference Name | 1st International Conference on Relations, Orders and Graphs : Interaction with Computer Science (ROGICS) |
| Start Date | May 12, 2008 |
| End Date | May 17, 2008 |
| Publication Date | Jan 1, 2008 |
| Deposit Date | Dec 8, 2011 |
| Publicly Available Date | May 30, 2012 |
| Pages | 152-158 |
| Public URL | https://durham-repository.worktribe.com/output/1157390 |
| Publisher URL | http://www.site.uottawa.ca/~lrakotom/rogics2008/ |
Files
Presentation
(143 Kb)
PDF
You might also like
Interference-free walks in time: Temporally disjoint paths
(2022)
Journal Article
Equitable scheduling on a single machine
(2022)
Journal Article
The Power of Linear-Time Data Reduction for Maximum Matching
(2020)
Journal Article
When can graph hyperbolicity be computed in linear time?
(2018)
Journal Article
A linear-time algorithm for maximum-cardinality matching on cocomparability graphs
(2018)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search