Isomorphism test for digraphs with weighted edges

DOI10.4230/LIPICS.SEA.2018.30zbMATH Open1493.68279OpenAlexW2808723739MaRDI QIDQ5140741FDOQ5140741

Authors: Adolfo Piperno 

Publication date: 16 December 2020

Full work available at URL: https://dblp.uni-trier.de/db/conf/wea/sea2018.html#Piperno18

Recommendations

• Practical graph isomorphism. II.
• On the power of color refinement
• scientific article; zbMATH DE number 5525608
• Dimension reduction via colour refinement
• Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement

zbMATH Keywords

partition refinementweighted directed graphspractical graph isomorphism

Mathematics Subject Classification ID

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)

Cites Work

• Practical graph isomorphism. II.
• An optimal lower bound on the number of variables for graph identification
• Title not available (Why is that?)
• Title not available (Why is that?)
• Engineering an efficient canonical labeling tool for large and sparse graphs
• An Efficient Algorithm for Graph Isomorphism
• Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
• Graph isomorphism in quasipolynomial time (extended abstract)
• Conflict propagation and component recursion for canonical labeling
• Benchmark Graphs for Practical Graph Isomorphism
• An algorithm for the reduction of finite non-oriented graphs to canonical form

Uses Software

• nauty
• Traces
• bliss
• conauto

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)