J. Fiala
Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms
Fiala, J.; Paulusma, D.; Telle, J.A.
Citation
Fiala, J., Paulusma, D., & Telle, J. (2005, June). Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms. Presented at WG 2005: Graph-Theoretic Concepts in Computer Science, Metz, France
| Presentation Conference Type | Conference Paper (published) |
|---|---|
| Conference Name | WG 2005: Graph-Theoretic Concepts in Computer Science |
| Start Date | Jun 23, 2005 |
| End Date | Jun 25, 2005 |
| Publication Date | 2005 |
| Deposit Date | Dec 20, 2014 |
| Print ISSN | 0302-9743 |
| Publisher | Springer |
| Peer Reviewed | Peer Reviewed |
| Volume | 3787 |
| Pages | 115-126 |
| Series ISSN | 0302-9743,1611-3349 |
| Book Title | Graph-Theoretic Concepts in Computer Science |
| ISBN | 978-3-540-31000-6 |
| DOI | https://doi.org/10.1007/11604686_11 |
| Public URL | https://durham-repository.worktribe.com/output/1153481 |
You might also like
Computing balanced solutions for large international kidney exchange schemes
(2024)
Journal Article
An Algorithmic Framework for Locally Constrained Homomorphisms
(2024)
Journal Article
Solving problems on generalized convex graphs via mim-width
(2023)
Journal Article
The Complexity of Matching Games: A Survey
(2023)
Journal Article
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs
(2023)
Journal Article