Lattice complete graphs

DOI10.1134/S1990478917040032zbMath1399.05186OpenAlexW2770492750MaRDI QIDQ5374007

Andrey A. Dobrynin, Yu. E. Bessonov

Publication date: 6 April 2018

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1990478917040032

zbMATH Keywords

cliquerectangular lattice

Mathematics Subject Classification ID

Applications of graph theory (05C90) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geometric algorithms and combinatorial optimization
• Subgraph isomorphism, matching relational structures and maximal cliques
• A note on the derivation of maximal common subgraphs of two directed or undirected graphs
• Backtrack search algorithms and the maximal common subgraph problem
• An Algorithm for Subgraph Isomorphism
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Optimization of FPGA configurations using parallel genetic algorithm

This page was built for publication: Lattice complete graphs