Polynomial-time algorithm for isomorphism of graphs with clique-width at most three (Q1986558): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
aliases / en / 0aliases / en / 0
 
Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three
description / endescription / en
scientific article
scientific article; zbMATH DE number 6622019
Property / title
 
Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three (English)
Property / title: Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1476.05138 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-42634-1_5 / rank
 
Normal rank
Property / published in
 
Property / published in: Lecture Notes in Computer Science / rank
 
Normal rank
Property / publication date
 
2 September 2016
Timestamp+2016-09-02T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 2 September 2016 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6622019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963714030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3198137016 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1506.01695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912033 / 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: Polynomial-time recognition of clique-width \(\leq 3\) graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handle-rewriting hypergraph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Decomposition Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithm for isomorphism of graphs with clique-width at most three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-Width is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent developments on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth / 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: An O(n2) Algorithm for Undirected Split Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations / 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: Q3312272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular decomposition and transitive orientation / rank
 
Normal rank

Latest revision as of 09:12, 22 July 2024

scientific article; zbMATH DE number 6622019
  • Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three
Language Label Description Also known as
English
Polynomial-time algorithm for isomorphism of graphs with clique-width at most three
scientific article; zbMATH DE number 6622019
  • Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three

Statements

Polynomial-time algorithm for isomorphism of graphs with clique-width at most three (English)
0 references
Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three (English)
0 references
0 references
0 references
0 references
0 references
0 references
8 April 2020
0 references
2 September 2016
0 references
0 references
0 references
0 references
0 references
0 references
0 references
clique-width
0 references
graph isomorphism
0 references
algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references