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

Revision as of 12:01, 12 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

instance of

scholarly article

0 references

title

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

author

Bireswar Das

0 references

Murali Krishna Enduri

0 references

I. Vinod Reddy

0 references

published in

Theoretical Computer Science

0 references

Lecture Notes in Computer Science

0 references

publication date

8 April 2020

0 references

2 September 2016

0 references

full work available at URL

https://arxiv.org/abs/1506.01695

0 references

zbMATH Keywords

clique-width

0 references

graph isomorphism

0 references

algorithm

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q3912033

0 references

Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees

0 references

Does co-NP have short interactive proofs ?

0 references

Polynomial-time recognition of clique-width \(\leq 3\) graphs

0 references

Handle-rewriting hypergraph grammars

0 references

Linear time solvable optimization problems on graphs of bounded clique-width

0 references

Upper bounds to the clique width of graphs

0 references

Q4954442

0 references

A Combinatorial Decomposition Theory

0 references

Decomposition of Directed Graphs

0 references

Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs

0 references

Polynomial-time algorithm for isomorphism of graphs with clique-width at most three

0 references

Clique-Width is NP-Complete

0 references

Transitiv orientierbare Graphen

0 references

Q5678892

0 references

Recent developments on graphs of bounded clique-width

0 references

Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth

0 references

Isomorphism of graphs of bounded valence can be tested in polynomial time

0 references

An O(n2) Algorithm for Undirected Split Decomposition

0 references

Approximating clique-width and branch-width

0 references

Testing branch-width

0 references

Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations

0 references

Identifiers

zbMATH Open document ID

1437.05165

0 references

1476.05138

0 references

DOI

10.1016/j.tcs.2017.09.013

0 references

10.1007/978-3-319-42634-1_5

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1986558

@@ 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