The following pages link to (Q3328583):
Displayed 50 items.
- An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs (Q290218) (← links)
- The recognition of geodetically connected graphs (Q293190) (← links)
- Pattern matching for permutations (Q293263) (← links)
- Vertex ranking of asteroidal triple-free graphs (Q293448) (← links)
- Bandwidth of chain graphs (Q293476) (← links)
- Consecutive retrieval property -- revisited (Q294594) (← links)
- Recognizing cographs and threshold graphs through a classification of their edges (Q294753) (← links)
- On the performance of the first-fit coloring algorithm on permutation graphs (Q294842) (← links)
- Recognizing \(i\)-triangulated graphs in \(O(mn)\) time (Q294870) (← links)
- Split graphs and Nordhaus-Gaddum graphs (Q297938) (← links)
- Circular convex bipartite graphs: feedback vertex sets (Q300230) (← links)
- Inverse chromatic number problems in interval and permutation graphs (Q319198) (← links)
- Chronological rectangle digraphs (Q324764) (← links)
- On containment graphs of paths in a tree (Q324771) (← links)
- Tri-connectivity augmentation in trees (Q327625) (← links)
- Largest chordal and interval subgraphs faster than \(2^n\) (Q329301) (← links)
- Notes on a theorem of Naji (Q329556) (← links)
- Colourings, homomorphisms, and partitions of transitive digraphs (Q338575) (← links)
- Characterizing width two for variants of treewidth (Q344827) (← links)
- Treewidth and pathwidth parameterized by the vertex cover number (Q344839) (← links)
- On recognition of threshold tolerance graphs and their complements (Q344853) (← links)
- Complexity of coloring graphs without paths and cycles (Q344861) (← links)
- Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve (Q364848) (← links)
- Online scheduling with interval conflicts (Q372978) (← links)
- Transitive oriented 3 hypergraphs of cyclic orders (Q382898) (← links)
- Obstructions to partitions of chordal graphs (Q383740) (← links)
- Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows (Q389670) (← links)
- Two characterisations of the minimal triangulations of permutation graphs (Q390311) (← links)
- Recognition and characterization of chronological interval digraphs (Q396800) (← links)
- Nordhaus-Gaddum theorem for the distinguishing chromatic number (Q396886) (← links)
- Permutation bigraphs and interval containments (Q401140) (← links)
- Random threshold digraphs (Q405260) (← links)
- Organizing the atoms of the clique separator decomposition into an atom tree (Q406311) (← links)
- Partial multicovering and the \(d\)-consecutive ones property (Q408373) (← links)
- An efficient algorithm to solve the conditional covering problem on trapezoid graphs (Q410643) (← links)
- Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms (Q415269) (← links)
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
- Trimming weighted graphs of bounded treewidth (Q415289) (← links)
- Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models (Q415616) (← links)
- Online variable-sized bin packing with conflicts (Q429693) (← links)
- Subgraph isomorphism in graph classes (Q456655) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes (Q463287) (← links)
- Certifying algorithms (Q465678) (← links)
- Approximation algorithms for intersection graphs (Q476425) (← links)
- The coloring problem for classes with two small obstructions (Q479257) (← links)
- The Laplacian energy of threshold graphs and majorization (Q486231) (← links)
- On the non-unit count of interval graphs (Q496432) (← links)
- On bounding the difference of the maximum degree and the clique number (Q497368) (← links)