Pages that link to "Item:Q3434989"
From MaRDI portal
The following pages link to Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs (Q3434989):
Displaying 36 items.
- Comparing series of rankings with ties by using complex networks: an analysis of the Spanish stock market (IBEX-35 index) (Q258462) (← links)
- Fast algorithms for the undirected negative cost cycle detection problem (Q261362) (← links)
- On unit interval graphs with integer endpoints (Q324887) (← links)
- Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection (Q344830) (← links)
- Permutation bigraphs and interval containments (Q401140) (← links)
- Certifying algorithms (Q465678) (← links)
- On graphs associated to sets of rankings (Q491081) (← links)
- Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs (Q628259) (← links)
- An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs (Q714793) (← links)
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
- Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs (Q967378) (← links)
- Approximation and fixed-parameter algorithms for consecutive ones submatrix problems (Q972381) (← links)
- A polynomial-time algorithm for the paired-domination problem on permutation graphs (Q1003667) (← links)
- A new graph parameter to measure linearity (Q1708605) (← links)
- Fully dynamic representations of interval graphs (Q1711837) (← links)
- Counting independent sets in cocomparability graphs (Q1721932) (← links)
- List matrix partitions of graphs representing geometric configurations (Q1741515) (← links)
- Recognition and characterization of unit interval graphs with integer endpoints (Q1752493) (← links)
- Normal Helly circular-arc graphs and its subclasses (Q1949109) (← links)
- Distributed interactive proofs for the recognition of some geometric intersection graph classes (Q2097349) (← links)
- A linear-time certifying algorithm for recognizing generalized series-parallel graphs (Q2104935) (← links)
- Algorithms and complexity of \(s\)-club cluster vertex deletion (Q2115849) (← links)
- Essential obstacles to Helly circular-arc graphs (Q2166233) (← links)
- Maximizing the strong triadic closure in split graphs and proper interval graphs (Q2197407) (← links)
- Stick graphs with length constraints (Q2206824) (← links)
- A certifying and dynamic algorithm for the recognition of proper circular-arc graphs (Q2232611) (← links)
- Recognition of split-graphic sequences (Q2254547) (← links)
- Certifying coloring algorithms for graphs without long induced paths (Q2414471) (← links)
- Construction sequences and certifying 3-connectivity (Q2428654) (← links)
- Minimal comparability completions of arbitrary graphs (Q2476257) (← links)
- A simple certifying algorithm for 3-edge-connectivity (Q2689444) (← links)
- On the Power of Graph Searching for Cocomparability Graphs (Q2801333) (← links)
- Uniquely Restricted Matchings in Interval Graphs (Q3130447) (← links)
- Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker--Boland Subgraphs (Q3462544) (← links)
- Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge (Q4908826) (← links)
- Recognizing Stick Graphs with and without Length Constraints (Q5141646) (← links)
