The following pages link to (Q3898496):
Displaying 32 items.
- Faster approximation for maximum independent set on unit disk graph (Q2398507) (← links)
- Minimal comparability completions of arbitrary graphs (Q2476257) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. II (Q2476265) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- The elimination procedure for the competition number is not optimal (Q2499585) (← links)
- The competition number of a graph having exactly one hole (Q2576849) (← links)
- A sequential algorithm for finding a maximum weight<i>K</i>-independent set on interval graphs (Q2710758) (← links)
- Algorithms for Interval Structures with Applications (Q3004669) (← links)
- Lexicographic Orientation Algorithms (Q3120444) (← links)
- Chronological Orderings of Interval Digraph (Q3439082) (← links)
- Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker--Boland Subgraphs (Q3462544) (← links)
- A simple linear-time algorithm for computing the center of an interval graph (Q3477967) (← links)
- Double Semiorders and Double Indifference Graphs (Q3669466) (← links)
- Inverting Signed Graphs (Q3703931) (← links)
- Extremal Values of the Interval Number of a Graph (Q3964599) (← links)
- Asymptotic distributions in random graphs with applications to social networks (Q3989499) (← links)
- Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph (Q4870967) (← links)
- Structural Analysis of Directed Signed Networks (Q5054505) (← links)
- Deferred-query—An efficient approach for problems on interval and circular-arc graphs (Q5060115) (← links)
- Linear game non-contextuality and Bell inequalities—a graph-theoretic approach (Q5855038) (← links)
- Stability for coupled systems on networks with Caputo-Hadamard fractional derivative (Q5855724) (← links)
- Total domination in interval graphs (Q5903263) (← links)
- On \(H\)-topological intersection graphs (Q5925535) (← links)
- Foundations of a connectivity theory for simplicial complexes (Q5933433) (← links)
- Some applications of graph theory to other parts of mathematics. (Q5949228) (← links)
- Model and methods to address urban road network problems with disruptions (Q6069920) (← links)
- The strong network orientation problem (Q6082268) (← links)
- Recognizing Proper Tree-Graphs (Q6089652) (← links)
- Exactly hittable interval graphs (Q6599815) (← links)
- Squares of graphs are optimally \((s, t)\)-supereulerian (Q6633548) (← links)
- Recognizing unit multiple interval graphs is hard (Q6648267) (← links)
- Graphs with supereulerian width 3 and small diameters (Q6672023) (← links)
