Blar i Department of Informatics på emneord "VDP::Matematikk og naturvitenskap: 400::Informasjons- og kommunikasjonsvitenskap: 420::Matematisk modellering og numeriske metoder: 427"

Viser treff 1-2 av 2

    • Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings 

      Pilipczuk, Michal Pawel (Peer reviewed; Journal article, 2013)
      The notions of cutwidth and pathwidth of digraphs play a central role in the containment theory for tournaments, or more generally semi-complete digraphs, developed in a recent series of papers by Chudnovsky, Fradkin, Kim, ...

    • Tight bounds for parameterized complexity of Cluster Editing 

      Fomin, Fedor; Kratsch, Stefan; Pilipczuk, Marcin; Pilipczuk, Michal Pawel; Villanger, Yngve (Peer reviewed; Journal article, 2013)
      In the Correlation Clustering problem, also known as Cluster Editing, we are given an undirected graph G and a positive integer k; the task is to decide whether G can be transformed into a cluster graph, i.e., a disjoint ...