Pith. sign in

REVIEW 1 cited by

Isomorphism Testing for Graphs of Bounded Rank Width

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1505.03737 v1 pith:JWRIPGCA submitted 2015-05-14 cs.DM cs.DSmath.CO

Martin Grohe , Pascal Schweitzer This is my paper · ORCID
classification cs.DMcs.DSmath.CO
keywords widthboundedisomorphismrankcliquegraphgraphspolynomial
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We give an algorithm that, for every fixed k, decides isomorphism of graphs of rank width at most k in polynomial time. As the clique width of a graph is bounded in terms of its rank width, we also obtain a polynomial time isomorphism test for graph classes of bounded clique width.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. On vertex sets inducing tangles

    math.CO 2024-11 conditional novelty 7.0 of 10

    Every k-tangle in a graph is the lift of a k-tangle in a topological minor of size bounded by a function of k, reducing the vertex-set induction problem to bounded-size graphs.

Pith tools