Node-weighted graphs having the König-Egerváry property
From MaRDI portal
Publication:3222885
DOI10.1007/BFb0121007zbMath0558.05054MaRDI QIDQ3222885
Jean-Marie Bourjolly, Peter L. Hammer, Bruno Simeone
Publication date: 1984
Published in: Mathematical Programming Studies (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75)
Related Items
An extension of the König-Egerváry property to node-weighted bidirected graphs, On the critical difference of almost bipartite graphs, A combinatorial column generation algorithm for the maximum stable set problem, When is \(G^2\) a König-Egerváry graph?, Two more characterizations of König-Egerváry graphs, Critical independent sets and König-Egerváry graphs, A classification of 1-well-covered graphs, On maximum matchings in König-Egerváry graphs, Polynomial time recognition of essential graphs having stability number equal to matching number, A characterization of Konig-Egervary graphs using a common property of all maximum matchings, Crown reductions for the minimum weighted vertex cover problem, A priori optimization for the probabilistic maximum independent set problem, Probabilistic graph-coloring in bipartite and split graphs, A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios, König-Egerváry graphs, 2-bicritical graphs and fractional matchings
