scientific article
From MaRDI portal
Publication:2808534
zbMath1336.05037MaRDI QIDQ2808534
Julien Bensmail, Romaric Duvignau, Sergey Kirgizov
Publication date: 24 May 2016
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2704/0.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (7)
Homomorphisms and colourings of oriented graphs: an updated survey ⋮ Analogues of cliques for \((m,n)\)-colored mixed graphs ⋮ On oriented cliques with respect to push operation ⋮ Complete oriented colourings and the oriented achromatic number ⋮ Outerplanar and Planar Oriented Cliques ⋮ Research on iterative repair algorithm of hyperchaotic image based on support vector machine ⋮ Efficient extraction algorithm for local fuzzy features of dynamic images
This page was built for publication:
