Pages that link to "Item:Q1575664"
From MaRDI portal
The following pages link to Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing (Q1575664):
Displaying 50 items.
- An optimal algorithm to recognize Robinsonian dissimilarities (Q269174) (← links)
- Optimal interval scheduling with a resource constraint (Q337149) (← links)
- A new LBFS-based algorithm for cocomparability graph recognition (Q344849) (← links)
- Fast-mixed searching and related problems on graphs (Q393051) (← links)
- Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms (Q415269) (← links)
- Reasoning about visibility (Q420853) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Efficient computation of tolerances in the weighted independent set problem for some classes of graphs (Q461929) (← links)
- Practical and efficient circle graph recognition (Q472484) (← links)
- Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
- Parameterized complexity of induced graph matching on claw-free graphs (Q487013) (← links)
- Strict chordal and strict split digraphs (Q516787) (← links)
- A general label search to investigate classical graph search algorithms (Q617648) (← links)
- Linear-time recognition of Helly circular-arc models and graphs (Q627542) (← links)
- A faster algorithm for finding minimum Tucker submatrices (Q693064) (← links)
- Graphs of linear clique-width at most 3 (Q719287) (← links)
- Into the square: on the complexity of some quadratic-time solvable problems (Q737085) (← links)
- Witness rectangle graphs (Q742595) (← links)
- Clustering analysis of a dissimilarity: a review of algebraic and geometric representation (Q779022) (← links)
- Computing the union join and subset graph of acyclic hypergraphs in subquadratic time (Q832905) (← links)
- Collective tree spanners in graphs with bounded parameters (Q848633) (← links)
- A tie-break model for graph search (Q896657) (← links)
- Minimal proper interval completions (Q963366) (← links)
- A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements (Q963386) (← links)
- On end-vertices of lexicographic breadth first searches (Q968161) (← links)
- Approximation and fixed-parameter algorithms for consecutive ones submatrix problems (Q972381) (← links)
- Minimal interval completion through graph exploration (Q1001896) (← links)
- A clique-difference encoding scheme for labelled \(k\)-path graphs (Q1003468) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. I (Q1003752) (← links)
- Algorithmic aspects of a general modular decomposition theory (Q1026102) (← links)
- Phylogenetic graph models beyond trees (Q1026198) (← links)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
- On the \(m\)-clique free interval subgraphs polytope: polyhedral analysis and applications (Q1631662) (← links)
- Fully dynamic representations of interval graphs (Q1711837) (← links)
- List matrix partitions of graphs representing geometric configurations (Q1741515) (← links)
- Finding maximum edge bicliques in convex bipartite graphs (Q1759663) (← links)
- Hardness results on the gapped consecutive-ones property problem (Q1759853) (← links)
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
- A simple linear time algorithm for cograph recognition (Q1764804) (← links)
- A Lex-BFS-based recognition algorithm for Robinsonian matrices (Q1786881) (← links)
- A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs (Q1827809) (← links)
- A note on the consecutive ones submatrix problem. (Q1853060) (← links)
- Normal Helly circular-arc graphs and its subclasses (Q1949109) (← links)
- A REVIEW OF TREE CONVEX SETS TEST (Q4649838) (← links)
- (Q5005172) (← links)
- Fast Diameter Computation within Split Graphs (Q5024674) (← links)
- (Q5874479) (← links)
- Linear optimization over homogeneous matrix cones (Q6047504) (← links)
- The diameter of AT‐free graphs (Q6057658) (← links)
- Recognizing interval bigraphs by forbidden patterns (Q6081553) (← links)
