The QAP-polytope and the graph isomorphism problem (Q1631655): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-018-0266-x / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: nauty / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Traces / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-018-0266-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2788334612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396558 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sherali-Adams relaxations and indistinguishability in counting logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912033 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the automorphism groups of strongly regular graphs I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism in quasipolynomial time [extended abstract] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Does co-NP have short interactive proofs ? / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal lower bound on the number of variables for graph identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Techniques for the Generation and Analysis of Strongly Regular Graphs and other Combinatorial Configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure theorem and isomorphism test for graphs with excluded topological subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebble Games and Linear Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism of Planar Graphs (Working Paper) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4148000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Box-inequalities for quadratic assignment polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4397722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Parallel Algorithms for Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval Graphs: Canonical Representation in Logspace / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for Deciding Interval Graph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism of graphs of bounded valence can be tested in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sherali-Adams relaxations of graph isomorphism polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the graph isomorphism counting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical graph isomorphism. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of Robust Graph Isomorphism, Lasserre Gaps, and Asymmetry of Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copositive and semidefinite relaxations of the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism is in the low hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on compact graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Geometrical Intersection Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3312272 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q130195012 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10878-018-0266-X / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:08, 11 December 2024

scientific article
Language Label Description Also known as
English
The QAP-polytope and the graph isomorphism problem
scientific article

    Statements

    The QAP-polytope and the graph isomorphism problem (English)
    0 references
    0 references
    0 references
    6 December 2018
    0 references
    quadratic assignment problem
    0 references
    graph isomorphism problem
    0 references
    polyhedral combinatorics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers