Detecting almost symmetries of graphs (Q1621684)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	Detecting almost symmetries of graphs	scientific article

Statements

scholarly article

Detecting almost symmetries of graphs (English)

Sebastian Pokutta

Mathematical Programming Computation

publication date

9 November 2018

zbMATH Keywords

almost symmetries

graph automorphism

branch-and-bound

describes a project that uses

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1007/s12532-017-0124-3

Approximate Graph Isomorphism

Graph isomorphism in quasipolynomial time [extended abstract]

PEBBL: an object-oriented framework for scalable parallel branch and bound

Asymmetric graphs

Relations between average case complexity and approximation complexity

Zero knowledge and the chromatic number

Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Pruning by isomorphism in branch-and-cut

Exploiting orbits in symmetric ILP

A note on the graph isomorphism counting problem

Practical graph isomorphism. II.

Algorithms for the Assignment and Transportation Problems

Hardness of Robust Graph Isomorphism, Lasserre Gaps, and Asymmetry of Random Graphs

Orbital branching

The graph isomorphism disease

Identifiers

zbMATH Open document ID

10.1007/s12532-017-0124-3

Mathematics Subject Classification ID

zbMATH DE Number

Sitelinks

Mathematics(1 entry)

mardi Publication:1621684

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1621684&oldid=36446690"