Optimal greedy algorithms for indifference graphs
From MaRDI portal
Publication:2365550
Recommendations
Cites work
- A Characterization of Comparability Graphs and of Interval Graphs
- A Linear Time Algorithm for Deciding Interval Graph Isomorphism
- An optimal greedy heuristic to color interval graphs
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3918092 (Why is no real title available?)
- scientific article; zbMATH DE number 3706451 (Why is no real title available?)
- scientific article; zbMATH DE number 3760213 (Why is no real title available?)
- Representation of a finite graph by a set of intervals on the real line
- Semiorders and a Theory of Utility Discrimination
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
Cited in
(73)- A dynamic distributed approach to representing proper interval graphs
- Greedy algorithms for tracking mobile users in special mobility graphs
- Secure domination in proper interval graphs
- A simple algorithm for secure domination in proper interval graphs
- Unit interval vertex deletion: fewer vertices are relevant
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
- Koszul binomial edge ideals of pairs of graphs
- A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
- Worpitzky-compatible subarrangements of braid arrangements and cocomparability graphs
- Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination
- The co-secure domination in proper interval graphs
- A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs
- Hamiltonian paths, unit-interval complexes, and determinantal facet ideals
- Sufficient conditions for the optimality of the greedy algorithm in greedoids
- Maximizing the strong triadic closure in split graphs and proper interval graphs
- A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs
- Sortable simplicial complexes and \(t\)-independence ideals of proper interval graphs
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs
- Clique-width of full bubble model graphs
- Extending partial representations of subclasses of chordal graphs
- Sitting closer to friends than enemies, revisited
- Fragmented coloring of proper interval and split graphs
- On the thinness and proper thinness of a graph
- The Roberts characterization of proper and unit interval graphs
- Packing triangles in low degree graphs and indifference graphs
- Complexity of Hamiltonian cycle reconfiguration
- Algorithms for finding disjoint path covers in unit interval graphs
- Acyclic matching in some subclasses of graphs
- On the power of graph searching for cocomparability graphs
- A new representation of proper interval graphs with an application to clique-width
- Vertex ordering characterizations of graphs of bounded asteroidal number
- Polynomial kernels for proper interval completion and related problems
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- Polynomial kernels for proper interval completion and related problems
- Sphere and dot product representations of graphs
- Computing role assignments of proper interval graphs in polynomial time
- Induced subgraph isomorphism on proper interval and bipartite permutation graphs
- On central max-point-tolerance graphs
- Total Roman domination for proper interval graphs
- Circularly compatible ones, D-circularity, and proper circular-arc bigraphs
- Coloring problem of signed interval graphs
- Simultaneous representation of proper and unit interval graphs
- On some subclasses of interval catch digraphs
- Maximizing the strong triadic closure in split graphs and proper interval graphs
- On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
- Gorenstein binomial edge ideals associated with scrolls
- A structural characterization for certifying Robinsonian matrices
- Similarity-first search: a new algorithm with application to Robinsonian matrix recognition
- An optimization parameter for seriation of noisy data
- scientific article; zbMATH DE number 6469169 (Why is no real title available?)
- Graph classes and forbidden patterns on three vertices
- Characterization of some classes of graphs with equal domination number and isolate domination number
- Template-driven rainbow coloring of proper interval graphs
- A Subexponential Parameterized Algorithm for Proper Interval Completion
- The parameterized complexity of cycle packing: indifference is not an issue
- Template-driven rainbow coloring of proper interval graphs
- Dirac's theorem and multigraded syzygies
- Efficient algorithms for independent Roman domination on some classes of graphs
- Algorithmic complexity of triple Roman dominating functions on graphs
- Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang
- Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
- Bandwidth on AT-free graphs
- The complexity of recognizing geometric hypergraphs
- An algorithm for the secure total domination problem in proper interval graphs
- Semi-proper interval graphs
- Tree-layout based graph classes: proper chordal graphs
- Simultaneous representation of proper and unit interval graphs
- On the unit interval graphs which are paired k-disjoint path coverable
- The complexity of recognizing geometric hypergraphs
- The edge-vertex domination and weighted edge-vertex domination problem
- Dense and nondense limits for uniform random intersection graphs
- Improved bounds on proper conflict-free coloring of graphs
- Recognizing and representing proper interval graphs in parallel using merging and sorting
This page was built for publication: Optimal greedy algorithms for indifference graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2365550)
