Dispersed Points and Geometric Embedding of Complete Bipartite Graphs.
H. Maehara (1991)
Discrete & computational geometry
Similarity:
H. Maehara (1991)
Discrete & computational geometry
Similarity:
B. Chazelle, N. Shouraboura (1995)
Discrete & computational geometry
Similarity:
H. Maehara (1991)
Discrete & computational geometry
Similarity:
Bert L. Hartnell, Douglas F. Rall (2003)
Discussiones Mathematicae Graph Theory
Similarity:
The study of domination in Cartesian products has received its main motivation from attempts to settle a conjecture made by V.G. Vizing in 1968. He conjectured that γ(G)γ(H) is a lower bound for the domination number of the Cartesian product of any two graphs G and H. Most of the progress on settling this conjecture has been limited to verifying the conjectured lower bound if one of the graphs has a certain structural property. In addition, a number of authors have established bounds...
José Soares (1994)
Discrete & computational geometry
Similarity:
N. Alon, S. Suri, P.K. Agarwal, B. Aronov (1994)
Discrete & computational geometry
Similarity:
D.P. Dobkin, S.J. Friedman, K.J. Supowit (1990)
Discrete & computational geometry
Similarity:
François Clautiaux, Aziz Moukrim, Stéphane Nègre, Jacques Carlier (2010)
RAIRO - Operations Research
Similarity:
The notion of treewidth is of considerable interest in relation to NP-hard problems. Indeed, several studies have shown that the tree-decomposition method can be used to solve many basic optimization problems in polynomial time when treewidth is bounded, even if, for arbitrary graphs, computing the treewidth is NP-hard. Several papers present heuristics with computational experiments. For many graphs the discrepancy between the heuristic results and the best lower bounds is still...
J. Reiterman, V Rödl, E. Sinajová (1989)
Discrete & computational geometry
Similarity: