Pages that link to "Item:Q2365550"
From MaRDI portal
The following pages link to Optimal greedy algorithms for indifference graphs (Q2365550):
Displaying 50 items.
- Algorithms for finding disjoint path covers in unit interval graphs (Q266951) (← links)
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008) (← links)
- Polynomial kernels for proper interval completion and related problems (Q393083) (← links)
- Sphere and dot product representations of graphs (Q411410) (← links)
- Computing role assignments of proper interval graphs in polynomial time (Q450561) (← links)
- Induced subgraph isomorphism on proper interval and bipartite permutation graphs (Q476868) (← links)
- A structural characterization for certifying Robinsonian matrices (Q529005) (← links)
- Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs (Q631789) (← links)
- Bandwidth on AT-free graphs (Q650939) (← links)
- Recognizing and representing proper interval graphs in parallel using merging and sorting (Q869564) (← links)
- A dynamic distributed approach to representing proper interval graphs (Q1045060) (← links)
- Greedy algorithms for tracking mobile users in special mobility graphs (Q1613403) (← links)
- Secure domination in proper interval graphs (Q1671314) (← links)
- A simple algorithm for secure domination in proper interval graphs (Q1741524) (← links)
- Unit interval vertex deletion: fewer vertices are relevant (Q1747495) (← links)
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
- A Lex-BFS-based recognition algorithm for Robinsonian matrices (Q1786881) (← links)
- Koszul binomial edge ideals of pairs of graphs (Q1794075) (← links)
- A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs (Q1827809) (← links)
- Worpitzky-compatible subarrangements of braid arrangements and cocomparability graphs (Q1979871) (← links)
- Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination (Q2025071) (← links)
- The co-secure domination in proper interval graphs (Q2078841) (← links)
- A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs (Q2102897) (← links)
- Hamiltonian paths, unit-interval complexes, and determinantal facet ideals (Q2168562) (← links)
- Maximizing the strong triadic closure in split graphs and proper interval graphs (Q2197407) (← links)
- A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs (Q2268855) (← links)
- Sortable simplicial complexes and \(t\)-independence ideals of proper interval graphs (Q2309236) (← links)
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← links)
- Clique-width of full bubble model graphs (Q2341723) (← links)
- Extending partial representations of subclasses of chordal graphs (Q2344737) (← links)
- Sitting closer to friends than enemies, revisited (Q2345988) (← links)
- Fragmented coloring of proper interval and split graphs (Q2355746) (← links)
- Extending partial representations of interval graphs (Q2408095) (← links)
- On the thinness and proper thinness of a graph (Q2414456) (← links)
- The Roberts characterization of proper and unit interval graphs (Q2461218) (← links)
- Packing triangles in low degree graphs and indifference graphs (Q2476287) (← links)
- Complexity of Hamiltonian cycle reconfiguration (Q2633261) (← links)
- Acyclic matching in some subclasses of graphs (Q2680984) (← links)
- On the Power of Graph Searching for Cocomparability Graphs (Q2801333) (← links)
- A new representation of proper interval graphs with an application to clique-width (Q2839207) (← links)
- Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number (Q2940988) (← links)
- Polynomial Kernels for Proper Interval Completion and Related Problems (Q3088286) (← links)
- On central max-point-tolerance graphs (Q4956231) (← links)
- Total Roman domination for proper interval graphs (Q4958006) (← links)
- Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs (Q4986807) (← links)
- Coloring problem of signed interval graphs (Q4997206) (← links)
- (Q5075828) (← links)
- On some subclasses of interval catch digraphs (Q5081214) (← links)
- (Q5136273) (← links)
- On the <i>L</i>(<i>h</i>, <i>k</i>)‐labeling of co‐comparability graphs and circular‐arc graphs (Q5191125) (← links)