Приказ основних података о документу

H-colouring revisited

dc.creatorBožin, Vladimir
dc.creatorLazarević, Ivan
dc.date.accessioned2024-04-03T10:57:20Z
dc.date.available2024-04-03T10:57:20Z
dc.date.issued2023
dc.identifier.urihttps://grafar.grf.bg.ac.rs/handle/123456789/3485
dc.description.abstractIn this paper we give a new, shortened proof of NP-completeness of CSP problem for undirected, non bipartite graphs, of interest for generalization to QCSP problem. We also give some illustrative examples.sr
dc.language.isoensr
dc.publisherFaculty of Sciences and Mathematics, Department of Mathematicssr
dc.rightsopenAccesssr
dc.rights.urihttps://creativecommons.org/licenses/by-nc-nd/4.0/
dc.sourceFilomatsr
dc.subjectH-colouring undirected graphsr
dc.subjectCSPsr
dc.titleH-colouring revisitedsr
dc.typearticlesr
dc.rights.licenseBY-NC-NDsr
dc.citation.epage8754
dc.citation.spage8747
dc.identifier.doi10.2298/FIL2326747B
dc.identifier.fulltexthttp://grafar.grf.bg.ac.rs/bitstream/id/12954/bitstream_12954.pdf
dc.type.versionpublishedVersionsr


Документи

Thumbnail
Име:
bitstream_12954.pdf
Величина:
234.9Kb
Формат:
PDF
Отварање

Овај документ се појављује у следећим колекцијама

Приказ основних података о документу