Graph Sandwich Problems
From MaRDI portal
Recommendations
Cited in
(92)- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
- Exact algorithms for intervalizing coloured graphs
- Can transitive orientation make sandwich problems easier?
- Helly Property and Sandwich Graphs
- The P4-sparse Graph Sandwich Problem
- Characterizing and computing minimal cograph completions
- Block-graph width
- Orienting graphs to optimize reachability
- scientific article; zbMATH DE number 2230229 (Why is no real title available?)
- Partitions and well-coveredness: the graph sandwich problem
- The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem
- Obstructing visibilities with one obstacle
- Lexicographic orientation algorithms
- The polynomial dichotomy for three nonempty part sandwich problems
- Simultaneous representation of proper and unit interval graphs
- Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes
- Partitioned probe comparability graphs
- The sandwich problem for odd-hole-free and even-hole-free graphs
- The graph sandwich problem for 1-join composition is NP-complete
- The graph sandwich problem for P₄-sparse graphs
- On listing, sampling, and counting the chordal graphs with edge constraints
- Chordal bipartite completion of colored graphs
- Algorithms and complexity of sandwich problems in graphs (extended abstract)
- Complexity and algorithms for graph and hypergraph sandwich problems
- Matrix sandwich problems
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
- The interval order polytope of a digraph
- Sandwich and probe problems for excluding paths
- On the probe problem for (r, )-well-coveredness
- The graph sandwich problem for 1-join composition is NP-complete
- A general method for forbidden induced subgraph sandwich problem NP-completeness
- On the forbidden induced subgraph probe and sandwich problems
- scientific article; zbMATH DE number 6423755 (Why is no real title available?)
- The P versus NP-complete dichotomy of some challenging problems in graph theory
- The homogeneous set sandwich problem
- On the complexity of probe and sandwich problems for generalized threshold graphs
- Simultaneous representation of proper and unit interval graphs
- The strength of Dantzig-Wolfe reformulations for the stable set and related problems
- On decision and optimization (\(k\),\(l\))-graph sandwich problems
- Near-optimal solutions for the generalized max-controlled set problem
- The external constraint 4 nonempty part sandwich problem
- The chain graph sandwich problem
- scientific article; zbMATH DE number 7053390 (Why is no real title available?)
- Completing colored graphs to meet a target property
- Characterizing and Computing Minimal Cograph Completions
- On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints
- The pair completion algorithm for the homogeneous set sandwich problem
- Tree-visibility orders
- Bipartite completion of colored graphs avoiding chordless cycles of given lengths
- Complexity classification of some edge modification problems
- On the complexity of computing treelength
- A note on finding all homogeneous set sandwiches
- Some completion problems for graphs without chordless cycles of prescribed lengths
- Clustering with partial information
- Competitive graph searches
- Unique perfect phylogeny is NP-hard
- The sandwich problem for cutsets: clique cutset, \(k\)-star cutset
- Skew partition sandwich problem is NP-complete
- An efficient algorithm for solving the homogeneous set sandwich problem
- Some complexity results about threshold graphs
- On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems
- The sandwich problem for decompositions and almost monotone properties
- Threshold-coloring and unit-cube contact representation of planar graphs
- Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone
- Efficiently enumerating minimal triangulations
- A vertex ordering characterization of simple-triangle graphs
- Sandwiches missing two ingredients of order four
- Clustering with Partial Information
- Characterizing and recognizing probe block graphs
- On the forbidden induced subgraph sandwich problem
- A characterization of chain probe graphs
- Two characterizations of chain partitioned probe graphs
- Recognition of Probe Ptolemaic Graphs
- The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy
- Strongly chordal and chordal bipartite graphs are sandwich monotone
- Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games
- Good characterizations and linear time recognition for 2-probe block graphs
- On the proper intervalization of colored caterpillar trees
- On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
- The Proper Interval Colored Graph problem for caterpillar trees
- The polynomial dichotomy for three nonempty part sandwich problems
- On the bi-enhancement of chordal-bipartite probe graphs
- On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs
- An improved derandomized approximation algorithm for the max-controlled set problem
- A short note on the complexity of computing strong pathbreadth
- On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity
- Characterizations, probe and sandwich problems on \(( k , \ell )\)-cographs
- Tree projections: Game characterization and computational aspects
- The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
- The Generalized Max-Controlled Set Problem
- Listing maximal H-free subgraphs
- Weak unit disk and interval representation of graphs
This page was built for publication: Graph Sandwich Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4857542)
