Vis enkel innførsel

dc.contributor.authorFellows, Mikeeng
dc.contributor.authorHeggernes, Pinareng
dc.contributor.authorRosamond, Franceseng
dc.contributor.authorSloper, Christianeng
dc.contributor.authorTelle, Jan Arneeng
dc.date.accessioned2006-03-01T15:57:29Z
dc.date.available2006-03-01T15:57:29Z
dc.date.issued2004eng
dc.PublishedLecture Notes in Computer Science vol 3353, 235-244, Proceedings WG'04 - 30th Workshop on Graph Theoretic Concepts in Computer Science (WG 2004), Bad Honnef, Germany,June 2004, Springer Verlagen
dc.identifier.isbn3-540-24132-9en_US
dc.identifier.issn0302-9743en_US
dc.identifier.urihttps://hdl.handle.net/1956/1114
dc.descriptionThis paper appeared at the conference ’30th International Workshop of Graph-Theoretic Concepts in Computer Science’ and was published in the proceedings [FHRST04].en
dc.format.extent116308 byteseng
dc.format.mimetypeapplication/pdfeng
dc.language.isoengeng
dc.publisherSpringer Verlagen_US
dc.titleFinding k Disjoint Triangles in an Arbitrary Graphen_US
dc.typeConference object
dc.description.versionacceptedVersionen_US
dc.identifier.doihttps://doi.org/10.1007/b104584


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel