Pages that link to "Item:Q922724"

The following pages link to An optimal greedy heuristic to color interval graphs (Q922724):

Displaying 50 items.

• A linear time algorithm to compute square of interval graphs and their colouring (Q322053) (← links)
• A new LBFS-based algorithm for cocomparability graph recognition (Q344849) (← links)
• Scheduling light-trails on WDM rings (Q455990) (← links)
• The worst case behavior of randomized gossip protocols (Q477180) (← links)
• \(L(2,1)\)-labeling of interval graphs (Q500005) (← links)
• Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
• Scheduling preparation of doses for a chemotherapy service (Q601167) (← links)
• Bandwidth on AT-free graphs (Q650939) (← links)
• A linear time algorithm to compute a dominating path in an AT-free graph (Q673002) (← links)
• Thinness of product graphs (Q831864) (← links)
• Selection of programme slots of television channels for giving advertisement: a graph theoretic approach (Q881882) (← links)
• Hardness and approximation of minimum distortion embeddings (Q991793) (← links)
• Minimal interval completion through graph exploration (Q1001896) (← links)
• Nash equilibria in all-optical networks (Q1043952) (← links)
• On minimum intersection of two minimum dominating sets of interval graphs (Q1377653) (← links)
• Routing and path multicoloring (Q1607124) (← links)
• Greedy algorithms for tracking mobile users in special mobility graphs (Q1613403) (← links)
• An \(\mathcal O(n\sqrt m)\) algorithm for the weighted stable set problem in \{claw, net\}-free graphs with \(\alpha(G)\geq 4\) (Q1751148) (← 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)
• Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach (Q1791804) (← links)
• A vertex ordering characterization of simple-triangle graphs (Q1800397) (← links)
• Worpitzky-compatible subarrangements of braid arrangements and cocomparability graphs (Q1979871) (← links)
• Theoretical aspects of equitable partition of networks into sparse modules (Q2031046) (← links)
• Complexity of tree-coloring interval graphs equitably (Q2039688) (← links)
• Precedence thinness in graphs (Q2091785) (← links)
• Interval scheduling with economies of scale (Q2108158) (← links)
• Inverse interval scheduling via reduction on a single machine (Q2158006) (← links)
• Perfect elimination orderings for symmetric matrices (Q2174877) (← links)
• Hardness and algorithms of equitable tree-coloring problem in chordal graphs (Q2220774) (← links)
• Optimal greedy algorithms for indifference graphs (Q2365550) (← links)
• On the thinness and proper thinness of a graph (Q2414456) (← links)
• Chronological rectangle digraphs which are two-terminal series-parallel (Q2414469) (← links)
• The Roberts characterization of proper and unit interval graphs (Q2461218) (← links)
• The stable set problem and the thinness of a graph (Q2643810) (← links)
• On the Power of Graph Searching for Cocomparability Graphs (Q2801333) (← links)
• Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number (Q2940988) (← links)
• Improper coloring of unit disk graphs (Q3057115) (← links)
• A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs (Q4561265) (← links)
• An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) (← links)
• An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs (Q4985488) (← links)
• Minimum r-neighborhood covering set of permutation graphs (Q5025160) (← links)
• Heterogeneous Multi-resource Allocation with Subset Demand Requests (Q5057984) (← links)
• On the <i>L</i>(<i>h</i>, <i>k</i>)‐labeling of co‐comparability graphs and circular‐arc graphs (Q5191125) (← links)
• Fleet management for autonomous vehicles: Online PDP under special constraints (Q5242278) (← links)
• Graph Classes and Forbidden Patterns on Three Vertices (Q5855535) (← links)
• On coloring problems with local constraints (Q5891606) (← links)
• Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs (Q6064836) (← links)
• Computation of diameter, radius and center of permutation graphs (Q6115743) (← links)
• Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)