A network flow approach to a common generalization of Clar and Fries numbers
Clar number and Fries number are two thoroughly investigated parameters of plane graphs emerging from mathematical chemistry to measure stability of organic molecules. First, we introduce a common generalization of these two concepts for bipartite plane graphs, and then we extend it further to the n...
Uloženo v:
| Vydáno v: | Discrete mathematics Ročník 347; číslo 11; s. 114145 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
01.11.2024
|
| Témata: | |
| ISSN: | 0012-365X, 1872-681X |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | Clar number and Fries number are two thoroughly investigated parameters of plane graphs emerging from mathematical chemistry to measure stability of organic molecules. First, we introduce a common generalization of these two concepts for bipartite plane graphs, and then we extend it further to the notion of source-sink pairs of subsets of nodes in a general (not necessarily planar) directed graph. The main result is a min-max formula for the maximum weight of a source-sink pair. The proof is based on the recognition that the convex hull of source-sink pairs can be obtained as the projection of a network tension polyhedron. The construction makes it possible to apply any standard cheapest network flow algorithm to compute both a maximum weight source-sink pair and a minimizer of the dual optimization problem formulated in the min-max theorem. As a consequence, our approach gives rise to the first purely combinatorial, strongly polynomial algorithm to compute a largest (or even a maximum weight) Fries-set of a perfectly matchable plane bipartite graph and an optimal solution to the dual minimization problem. |
|---|---|
| ISSN: | 0012-365X 1872-681X |
| DOI: | 10.1016/j.disc.2024.114145 |