Isomorphism test for digraphs with weighted edges
From MaRDI portal
Publication:5140741
Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Signed and weighted graphs (05C22) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Recommendations
Cites work
- scientific article; zbMATH DE number 3823850 (Why is no real title available?)
- scientific article; zbMATH DE number 3460178 (Why is no real title available?)
- An Efficient Algorithm for Graph Isomorphism
- An algorithm for the reduction of finite non-oriented graphs to canonical form
- An optimal lower bound on the number of variables for graph identification
- Benchmark Graphs for Practical Graph Isomorphism
- Conflict propagation and component recursion for canonical labeling
- Engineering an efficient canonical labeling tool for large and sparse graphs
- Graph isomorphism in quasipolynomial time (extended abstract)
- Practical graph isomorphism. II.
- Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
This page was built for publication: Isomorphism test for digraphs with weighted edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140741)
