Finding a Maximum-Weight Convex Set in a Chordal Graph

We consider a natural combinatorial optimization problem on chordal graphs, the class of graphs with no induced cycle of length four or more. A subset of vertices of a chordal graph is (monophonically) convex if it contains the vertices of all chordless paths between any two vertices of the set. The problem is to find a maximum-weight convex subset of a given vertex-weighted chordal graph. It generalizes previously studied special cases in trees and split graphs. It also happens to be closely related to the closure problem in partially ordered sets and directed graphs. We give the first polynomial-time algorithm for the problem.

[1]  D. R. Fulkerson,et al.  Incidence matrices and interval graphs , 1965 .

[2]  J. Rhys.  A Selection Problem of Shared Fixed Costs and Network Flows , 1970 .

[3]  J. Hopcroft,et al.  Algorithm 447: efficient algorithms for graph manipulation , 1973, CACM.

[4]  Jeffrey B. Sidney,et al.  Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs , 1975, Oper. Res..

[5]  J. Picard.  Maximal Closure of a Graph and Applications to Combinatorial Problems , 1976 .

[6]  M. Golummc.  Algorithmic graph theory and perfect graphs , 1980 .

[7]  Robert E. Jamison-Waldner.  PARTITION NUMBERS FOR TREES AND ORDERED SETS , 1981 .

[8]  Heinz Gröflin.  Path-closed sets , 1984, Comb..

[9]  Paul H. Edelman,et al.  The theory of convex geometries , 1985 .

[10]  M. Farber,et al.  Convexity in graphs and hypergraphs , 1986 .

[11]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[12]  F. McMorris,et al.  Topics in Intersection Graph Theory , 1987 .

[13]  D. Orlin,et al.  Optimal weapons allocation against layered defenses , 1987 .

[14]  Martin Farber,et al.  On local convexity in graphs , 1987, Discret. Math..

[15]  László Lovász,et al.  Polyhedral Results for Antimatroids a , 1989 .

[16]  Richard C. T. Lee,et al.  Counting Clique Trees and Computing Perfect Elimination Schemes in Parallel , 1989, Inf. Process. Lett..

[17]  E. Andrew Boyd,et al.  An algorithmic characterization of antimatroids , 1990, Discret. Appl. Math..

[18]  David Eppstein,et al.  Finding minimum areak-gons , 1992, Discret. Comput. Geom..

[19]  B. Peyton,et al.  An Introduction to Chordal Graphs and Clique Trees , 1993 .

[20]  Laurence A. Wolsey,et al.  Optimizing constrained subtrees of trees , 1995, Math. Program..

[21]  G. Koshevoy.  Choice functions and abstract convex geometries , 1999 .

[22]  M. V. Semyonova,et al.  Lattices with unique irreducible decompositions , 2000 .

[23]  Justin C. Williams.  Convex Land Acquisition with Zero-One Programming , 2003 .

[24]  Manoj Changat,et al.  Induced path transit function, monotone and Peano axioms , 2004, Discret. Math..

[25]  Jesús Mario Bilbao,et al.  Cooperative games on antimatroids , 2004, Discret. Math..

[26]  Eric Ras,et al.  Learning Spaces , 2022, The SAGE Encyclopedia of Higher Education.

[27]  Louis Ibarra,et al.  The clique-separator graph for chordal graphs , 2009, Discret. Appl. Math..

[28]  Dieter Rautenbach,et al.  On finite convexity spaces induced by sets of paths in graphs , 2011, Discret. Math..

[29]  Douglas M. King,et al.  Geo-Graphs: An Efficient Model for Enforcing Contiguity and Hole Constraints in Planar Graph Partitioning , 2012, Oper. Res..

[30]  Anita Frances Parkinson.  Essays on sequence optimization in block cave mining and inventory policies with two delivery sizes , 2012 .

[31]  Ton Kloks,et al.  Gray Codes for AT-Free Orders via Antimatroids , 2015, IWOCA.

[32]  Jean Cardinal,et al.  On the shelling antimatroids of split graphs , 2015, Discret. Math. Theor. Comput. Sci..

[33]  David Eppstein.  The Parametric Closure Problem , 2018, ACM Trans. Algorithms.