Recognizing Greedy Structures
From MaRDI portal
Recommendations
- An Exact Characterization of Greedy Structures
- scientific article; zbMATH DE number 3871387
- 10.1162/153244303321897717
- Greedy detection
- Recognizing graph search trees
- Greedy defining sets of graphs
- The classification of greedy algorithms
- Recognizing decomposable graphs
- Recognizing Proper Tree-Graphs
- Greedy algorithm compatibility and heavy-set structures
Cited in
(35)- Greedily constructing maximal partial f-factors
- Greedy sets and related problems
- The uniformity space of hypergraphs and its applications
- The structure of well-covered graphs and the complexity of their recognition problems
- Weighted well-covered graphs without cycles of lengths 5, 6 and 7
- Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7
- Well-covered graphs without cycles of lengths 4, 5 and 6
- Optimal greedy algorithms for indifference graphs
- Recognizing well covered graphs of families with special \(P _{4}\)-components
- Well-dominated graphs without cycles of lengths 4 and 5
- On relating edges in graphs without cycles of length 4
- Modeling k-coteries by well-covered graphs
- It is hard to know when greedy is good for finding independent sets
- Well-covered triangulations. IV
- Canonical greedy algorithms and dynamic programming
- Graphs with maximal induced matchings of the same size
- On related edges in well-covered graphs without cycles of length 4 and 6
- Extending Berge's and Favaron's results about well-covered graphs
- WELL-COVERED GRAPHS: A SURVEY
- Weighted well-covered claw-free graphs
- A characterization of Zm-well-covered graphs of girth 6 or more
- Well-indumatched Trees and Graphs of Bounded Girth
- Recognizing generating subgraphs revisited
- Recognizing well-dominated graphs is coNP-complete
- 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\)
- Weighted well-covered graphs without \(C_{4}, C_{5}, C_{6}, C_{7}\)
- Results on Grundy chromatic number of join graph of graphs
- Distinct sizes of maximal independent sets on graphs with restricted girth
- Generating subgraphs in chordal graphs
- Complexity results for generating subgraphs
- Mind the independence gap
- Results on the Grundy chromatic number of graphs
- Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests
This page was built for publication: Recognizing Greedy Structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4864437)
