Pages that link to "Item:Q2365550"
From MaRDI portal
The following pages link to Optimal greedy algorithms for indifference graphs (Q2365550):
Displaying 14 items.
- Gorenstein binomial edge ideals associated with scrolls (Q5274854) (← links)
- Similarity-First Search: A New Algorithm with Application to Robinsonian Matrix Recognition (Q5351862) (← links)
- An Optimization Parameter for Seriation of Noisy Data (Q5376542) (← links)
- Graph Classes and Forbidden Patterns on Three Vertices (Q5855535) (← links)
- Characterization of some classes of graphs with equal domination number and isolate domination number (Q5858174) (← links)
- Template-driven rainbow coloring of proper interval graphs (Q5896886) (← links)
- A Subexponential Parameterized Algorithm for Proper Interval Completion (Q5899484) (← links)
- Temporal graph classes: a view through temporal separators (Q5915590) (← links)
- The parameterized complexity of cycle packing: indifference is not an issue (Q5919574) (← links)
- Template-driven rainbow coloring of proper interval graphs (Q5925620) (← links)
- Dirac's theorem and multigraded syzygies (Q6042131) (← links)
- Efficient algorithms for independent Roman domination on some classes of graphs (Q6097713) (← links)
- (Q6150942) (← links)
- Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang (Q6157427) (← links)