Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Cutting and Destroying Graphs using k-cuts
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics, Analysis and Probability Theory.
2009 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Place, publisher, year, edition, pages
2009. , p. 16
Series
U.U.D.M. project report ; 2019:41
National Category
Probability Theory and Statistics
Identifiers
URN: urn:nbn:se:uu:diva-395663OAI: oai:DiVA.org:uu-395663DiVA, id: diva2:1364826
Educational program
Bachelor Programme in Mathematics
Supervisors
Examiners
Available from: 2019-10-22 Created: 2019-10-22 Last updated: 2019-10-22Bibliographically approved

Open Access in DiVA

fulltext(478 kB)3 downloads
File information
File name FULLTEXT01.pdfFile size 478 kBChecksum SHA-512
6350461e065b27f0094d685321c27172d5c8800dc8ff859ed656cb4585cfd8a3221e27fb358cc5470caff9b0e69c22919819a76103ae98a6d5a405d1d6a92023
Type fulltextMimetype application/pdf

By organisation
Analysis and Probability Theory
Probability Theory and Statistics

Search outside of DiVA

GoogleGoogle Scholar
Total: 3 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 5 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf