Counting edge-injective homomorphisms and matchings on restricted graph classes
Curticapean, Radu and Dell, H and Roth, M (2017) Counting edge-injective homomorphisms and matchings on restricted graph classes. In: 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017). Leibniz International Proceedings in Informatics, LIPIcs (66). Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, 25:1-25:15. ISBN 978-3-95977-028-6 10.4230/LIPIcs.STACS.2017.25
|
Text
Curticapean_25_3297078_ny.pdf Download (645kB) | Preview |
Official URL: http://drops.dagstuhl.de/opus/volltexte/2017/7008/...
| Item Type: | Book Section |
|---|---|
| Subjects: | Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| Divisions: | Informatics Laboratory |
| SWORD Depositor: | MTMT Injector |
| Depositing User: | MTMT Injector |
| Date Deposited: | 30 Nov 2017 19:45 |
| Last Modified: | 21 Jul 2019 13:56 |
| URI: | https://eprints.sztaki.hu/id/eprint/9220 |
 |
Update Item |
