Lattice complete graphs
From MaRDI portal
Recommendations
Cites work
- A note on the derivation of maximal common subgraphs of two directed or undirected graphs
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- An Algorithm for Subgraph Isomorphism
- Backtrack search algorithms and the maximal common subgraph problem
- Geometric algorithms and combinatorial optimization
- scientific article; zbMATH DE number 3948059 (Why is no real title available?)
- scientific article; zbMATH DE number 3983212 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- Maximum common subgraph isomorphism algorithms
- Optimization of FPGA configurations using parallel genetic algorithm
- Subgraph isomorphism, matching relational structures and maximal cliques
Cited in
(5)- Simple congruence lattices of finite graphs
- Orthocomplemented complete lattices and graphs
- scientific article; zbMATH DE number 512901 (Why is no real title available?)
- scientific article; zbMATH DE number 5913 (Why is no real title available?)
- scientific article; zbMATH DE number 949392 (Why is no real title available?)
This page was built for publication: Lattice complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5374007)