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

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three
@@ description / en / description / 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)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.05138
@@ Property / zbMATH Open document ID: 1476.05138 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-319-42634-1_5
@@ Property / DOI: 10.1007/978-3-319-42634-1_5 / rank @@
+Normal rank
@@ Property / published in @@
+Lecture Notes in Computer Science
@@ Property / published in: Lecture Notes in Computer Science / rank @@
+Normal rank
@@ Property / publication date @@
+September 2016Timestamp +2016-09-02T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2016-09-02T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 2 September 2016 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6622019
@@ Property / zbMATH DE Number: 6622019 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3198137016
@@ Property / OpenAlex ID: W3198137016 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3912033
@@ Property / cites work: Q3912033 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
+Normal rank
@@ Property / cites work @@
+Does co-NP have short interactive proofs ?
@@ Property / cites work: Does co-NP have short interactive proofs ? / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-time recognition of clique-width \(\leq 3\) graphs
+Normal rank
@@ Property / cites work @@
+Handle-rewriting hypergraph grammars
@@ Property / cites work: Handle-rewriting hypergraph grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Upper bounds to the clique width of graphs
@@ Property / cites work: Upper bounds to the clique width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4954442
@@ Property / cites work: Q4954442 / rank @@
+Normal rank
@@ Property / cites work @@
+A Combinatorial Decomposition Theory
@@ Property / cites work: A Combinatorial Decomposition Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition of Directed Graphs
@@ Property / cites work: Decomposition of Directed Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs
+Normal rank
@@ Property / cites work @@
+Polynomial-time algorithm for isomorphism of graphs with clique-width at most three
+Normal rank
@@ Property / cites work @@
+Clique-Width is NP-Complete
@@ Property / cites work: Clique-Width is NP-Complete / rank @@
+Normal rank
@@ Property / cites work @@
+Transitiv orientierbare Graphen
@@ Property / cites work: Transitiv orientierbare Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+Q5678892
@@ Property / cites work: Q5678892 / rank @@
+Normal rank
@@ Property / cites work @@
+Recent developments on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
+Normal rank
@@ Property / cites work @@
+Isomorphism of graphs of bounded valence can be tested in polynomial time
+Normal rank
@@ Property / cites work @@
+An O(n2) Algorithm for Undirected Split Decomposition
+Normal rank
@@ Property / cites work @@
+Approximating clique-width and branch-width
@@ Property / cites work: Approximating clique-width and branch-width / rank @@
+Normal rank
@@ Property / cites work @@
+Testing branch-width
@@ Property / cites work: Testing branch-width / rank @@
+Normal rank
@@ Property / cites work @@
+Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
+Normal rank
@@ Property / cites work @@
+Graph isomorphism in quasipolynomial time [extended abstract]
+Normal rank
@@ Property / cites work @@
+Q3312272
@@ Property / cites work: Q3312272 / rank @@
+Normal rank
@@ Property / cites work @@
+Modular decomposition and transitive orientation
@@ Property / cites work: Modular decomposition and transitive orientation / rank @@
+Normal rank

Latest revision as of 08: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