Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,237,882 papers from all fields of science
Search
Sign In
Create Free Account
Graph sandwich problem
Known as:
Graph Sandwich Problems
In graph theory and computer science, the graph sandwich problem is a problem of finding a graph that belongs to a particular family of graphs and is…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Computer science
Graph theory
Induced path
Martin Charles Golumbic
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
On the forbidden induced subgraph probe and sandwich problems
F. Couto
,
L. Faria
,
Sylvain Gravier
,
S. Klein
Discrete Applied Mathematics
2018
Corpus ID: 27491033
2016
2016
The (k, ℓ) unpartitioned probe problem NP-complete versus polynomial dichotomy
S. Dantas
,
L. Faria
,
C. M. Figueiredo
,
Rafael B. Teixeira
Information Processing Letters
2016
Corpus ID: 29114382
2015
2015
Cograph-( k , ` ) Graph Sandwich Problem
F. Couto
2015
Corpus ID: 18626449
A cograph is a graph without induced P4 (where P4 denotes an induced path with 4 vertices). A graph G is (k, `) if its vertex set…
Expand
2013
2013
On (k, ℓ)-Graph Sandwich Problems
F. Couto
,
L. Faria
,
S. Klein
,
Fábio Protti
,
L. T. Nogueira
FAW-AAIM
2013
Corpus ID: 36242367
In this work we consider the Golumbic, Kaplan and Shamir graph sandwich decision problem for property Π, where given two graphs G…
Expand
2011
2011
Exact Algorithms for Intervalizing Coloured Graphs
H. Bodlaender
,
Johan M. M. van Rooij
Theory of Computing Systems
2011
Corpus ID: 321015
In the Intervalizing Coloured Graphs problem, one must decide for a given graph G = (V, E) with a proper vertex colouring of G…
Expand
2007
2007
On Stubborn Graph Sandwich Problems
S. Dantas
,
L. Faria
International Multi-Conference on Computing in…
2007
Corpus ID: 16920753
The stubborn partition is a partition of the vertex set of a graph G into at most four parts A, B, C, D, with the following…
Expand
2005
2005
The P4-sparse Graph Sandwich Problem
S. Dantas
,
S. Klein
,
C. Mello
,
A. Morgana
Electron. Notes Discret. Math.
2005
Corpus ID: 41284141
2005
2005
Helly Property and Sandwich Graphs
M. C. Dourado
,
Priscila Petito
,
Rafael B. Teixeira
Electron. Notes Discret. Math.
2005
Corpus ID: 34809351
1998
1998
Complexity and Algorithms for Graph and Hypergraph Sandwich Problems
M. Golumbic
,
Amir Wassermann
Graphs Comb.
1998
Corpus ID: 45576341
Abstract. The ℱ Hypergraph Sandwich Problem (ℱHSP) is introduced here as follows: Given two hypergraphs H1=(X,ℰ1) and H2=(X,ℰ2…
Expand
1992
1992
Interval Graphs, Interval Orders and the Consistency of Temporal Events
M. Golumbic
,
R. Shamir
Israel Symposium on Theory of Computing Systems
1992
Corpus ID: 5218763
Temporal events are regarded here as intervals on a time line. This paper deals with problems in reasoning about such intervals…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE