A Linear Algorithm for Construction of Optimal Digital Convex 2k-gons
Dragan M. Acketa, Snežana Matić - Kekić, Joviša D. Žunić (1993)
The Yugoslav Journal of Operations Research
Similarity:
Displaying similar documents to “On a Construction of Digital Convex -gons of Minimum Diameter”
A Linear Algorithm for Construction of Optimal Digital Convex 2k-gons
Bounds on the Turán density of PG(3, 2).
Cioabă, Sebastian M. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On minimal area augmentation of digital convex -gons
Snežana Matić-Kekić, Dragan M. Acketa (1998)
Mathematica Slovaca
Similarity:
Enumeration of perfect matchings of a type of quadratic lattice on the torus.
Lu, Fuliang, Zhang, Lianzhu, Lin, Fenggen (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on divisibility of the number of matchings of a family of graphs.
Hwang, Kyung-Won, Sheikh, Naeem N., Hartke, Stephen G. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Existence of perfect matchings in a plane bipartite graph
Zhongyuan Che (2010)
Czechoslovak Mathematical Journal
Similarity:
We give a necessary and sufficient condition for the existence of perfect matchings in a plane bipartite graph in terms of elementary edge-cut, which extends the result for the existence of perfect matchings in a hexagonal system given in the paper of F. Zhang, R. Chen and X. Guo (1985).
An Algorithm for a Simple Construction of Suboptimal Digital Convex Polygons
Dragan M. Acketa, Snežana Matić-Kekić (1992)
The Yugoslav Journal of Operations Research
Similarity:
A note on the hardness results for the labeled perfect matching problems in bipartite graphs
Jérôme Monnot (2008)
RAIRO - Operations Research
Similarity:
In this note, we strengthen the inapproximation bound of (log) for the labeled perfect matching problem established in J. Monnot, The Labeled perfect matching in bipartite graphs, (2005) 81–88, using a self improving operation in some hard instances. It is interesting to note that this self improving operation does not work for all instances. Moreover, based on this approach we deduce that the problem does not admit constant approximation algorithms for connected planar...
Pólya's permanent problem.
McCuaig, William (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the dimer problem and the Ising problem in finite 3-dimensional lattices.
Loebl, Martin (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity: