Recognizing Greedy Structures
From MaRDI portal
Publication:4864437
DOI10.1006/jagm.1996.0006zbMath0840.68106OpenAlexW2044585960MaRDI QIDQ4864437
Yair Caro, András Sebő, Michael Tarsi
Publication date: 20 February 1996
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/e742136515e4e030c58f1554ec94ddff8d413fce
Combinatorics in computer science (68R05) Parallel algorithms in computer science (68W10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
It is hard to know when greedy is good for finding independent sets ⋮ Recognizing well covered graphs of families with special \(P _{4}\)-components ⋮ The structure of well-covered graphs and the complexity of their recognition problems ⋮ Well-covered triangulations. IV ⋮ Results on the Grundy chromatic number of graphs ⋮ WELL-COVERED GRAPHS: A SURVEY ⋮ Graphs with maximal induced matchings of the same size ⋮ Well-dominated graphs without cycles of lengths 4 and 5 ⋮ Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests ⋮ A characterization of Zm-well-covered graphs of girth 6 or more ⋮ Extending Berge's and Favaron's results about well-covered graphs ⋮ Recognizing well-dominated graphs is coNP-complete ⋮ Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7 ⋮ Weighted well-covered graphs without \(C_{4}, C_{5}, C_{6}, C_{7}\) ⋮ Grundy number of corona product of some graphs ⋮ Computing well-covered vector spaces of graphs using modular decomposition ⋮ Well-covered graphs with constraints on \(\Delta\) and \(\delta\) ⋮ On relating edges in graphs without cycles of length 4 ⋮ ModelingK-coteries by well-covered graphs ⋮ Well-indumatched Trees and Graphs of Bounded Girth ⋮ Weighted well-covered claw-free graphs ⋮ Complexity results for generating subgraphs ⋮ Weighted well-covered graphs without cycles of lengths 5, 6 and 7 ⋮ Greedily constructing maximal partial \(f\)-factors ⋮ Greedy sets and related problems ⋮ On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6 ⋮ Mind the independence gap ⋮ The uniformity space of hypergraphs and its applications ⋮ Recognizing Generating Subgraphs Revisited ⋮ Well-covered graphs without cycles of lengths 4, 5 and 6
