Now showing items 1-3 of 3

  • Agra, Agostinho; Dahl, Geir; Haufmann, Torkel Andreas; Pinheiro, Sofia (Journal article / Tidsskriftartikkel / AcceptedVersion; Peer reviewed, 2017)
    We consider the problem of finding a maximum k-regular induced subgraph of a graph G. Theoretical results are established to compare upper bounds obtained from different techniques, including bounds from quadratic programming, ...
  • Haufmann, Torkel Andreas (Master thesis / Masteroppgave, 2011)
    Oppgaven omhandler komplett positive matriser, det vil si matriser som kan skrives på formen A = BB^T der B er elementvis ikkenegativ. Hovedproblemet i denne teorien er å avgjøre hvorvidt en matrise er komplett positiv. I ...
  • Dahl, Geir; Haufmann, Torkel Andreas (Journal article / Tidsskriftartikkel / PublishedVersion; Peer reviewed, 2016)
    A matrix of the form A = BBT where B is nonnegative is called completely positive (CP). Berman and Xu (2005) investigated a subclass of CP-matrices, called f0, 1g-completely positive matrices. We introduce a related concept ...