On Forming Committees

2011/01/01 by Penny Haxell · 20 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Optimization and Search Problems #Advanced Algebra and Logic #Vertex (graph theory) #Computer science #Combinatorics #Graph #Information retrieval #Mathematics #Theoretical computer science

paper · doi:10.4169/amer.math.monthly.118.09.777

published in American Mathematical Monthly 118(9), 777 (Taylor & Francis)

openalex publication_date 2011/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/04/04

Abstract

This paper surveys a collection of results on finding special sets of vertices in graphs with vertex partitions, all of which can viewed as models for “committee-choosing” problems.

Citations

• Independent systems of representatives in weighted graphs
• The Clique Complex and Hypergraph Matching

Cited by

• Finding independent transversals efficiently
• Hall's marriage theorem [wikipedia]

Related

• On Efficient Computation of DiRe Committees
• The Satisfactory Partition Problem
• Low Cost, Fair, and Representative Committees in a Metric Space
• Graphs, flags and partitions
• Path optimization and near-greedy analysis for graph partitioning: an empirical study