Cutting and Destroying Graphs using k-cuts
Main Author: | |
---|---|
Format: | Others |
Language: | English |
Published: |
Uppsala universitet, Analys och sannolikhetsteori
2009
|
Subjects: | |
Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-395663 |
id |
ndltd-UPSALLA1-oai-DiVA.org-uu-395663 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-UPSALLA1-oai-DiVA.org-uu-3956632019-10-22T22:01:26ZCutting and Destroying Graphs using k-cutsengLindström, Alfred MinhUppsala universitet, Analys och sannolikhetsteori2009Probability Theory and StatisticsSannolikhetsteori och statistikStudent thesisinfo:eu-repo/semantics/bachelorThesistexthttp://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-395663U.U.D.M. project report ; 2019:41application/pdfinfo:eu-repo/semantics/openAccess |
collection |
NDLTD |
language |
English |
format |
Others
|
sources |
NDLTD |
topic |
Probability Theory and Statistics Sannolikhetsteori och statistik |
spellingShingle |
Probability Theory and Statistics Sannolikhetsteori och statistik Lindström, Alfred Minh Cutting and Destroying Graphs using k-cuts |
author |
Lindström, Alfred Minh |
author_facet |
Lindström, Alfred Minh |
author_sort |
Lindström, Alfred Minh |
title |
Cutting and Destroying Graphs using k-cuts |
title_short |
Cutting and Destroying Graphs using k-cuts |
title_full |
Cutting and Destroying Graphs using k-cuts |
title_fullStr |
Cutting and Destroying Graphs using k-cuts |
title_full_unstemmed |
Cutting and Destroying Graphs using k-cuts |
title_sort |
cutting and destroying graphs using k-cuts |
publisher |
Uppsala universitet, Analys och sannolikhetsteori |
publishDate |
2009 |
url |
http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-395663 |
work_keys_str_mv |
AT lindstromalfredminh cuttinganddestroyinggraphsusingkcuts |
_version_ |
1719274450041438208 |