GlobalView

Showing items 1 - 7 of 7.

Add to Quick Collection   All 7 Results

  • First
  • Previous
  • 1
  • Next
  • Last
Sort:
 Add All Items to Quick Collection
Date: 2010
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/923287
Description: We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are asked to find a subset of... More
Reviewed: Reviewed
Date: 2009
Resource Type: conference paper
Identifier: uon:8859
Description: We investigate the computational complexity of a general "compression task" centrally occurring in the recently developed technique of iterative compression for exactly solving NP-hard minimization pr... More
Reviewed: Reviewed
Date: 2009
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/808425
Description: The computation of Kemeny rankings is central to many applications in the context of rank aggregation. Given a set of permutations (votes) over a set of candidates, one searches for a “consensus permu... More
Reviewed: Reviewed
Date: 2009
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.13/919432
Description: We introduce overlap cluster graph modification problems where, other than in most previous work, the clusters of the target graph may overlap. More precisely, the studied graph problems ask for a min... More
Reviewed: Reviewed
Date: 2009
Resource Type: conference paper
Identifier: uon:8862
Description: We study the equitable connected partition problem: partitioning the vertices of a graph into a specified number of classes, such that each class of the partition induces a connected subgraph, so that... More
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.13/45011
Description: The computation of Kemeny rankings is central to many applications in the context of rank aggregation. Unfortunately, the problem is NP-hard. Extending our previous work [AAIM 2008], we show that the ... More
Reviewed: Reviewed
Date: 2008
Resource Type: conference paper
Identifier: uon:5955
Description: The Kemeny Score problem is central to many applications in the context of rank aggregation. Given a set of permutations (votes) over a set of candidates, one searches for a "consensus permutation" th... More
Reviewed: Reviewed
  • First
  • Previous
  • 1
  • Next
  • Last