Isomorphism testing of k-trees is in NC, for fixed k (Q910212): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Properties and characterizations of             <i>k</i>             ‐trees
+Normal rank
@@ Property / cites work @@
+On acyclic simplicial complexes
@@ Property / cites work: On acyclic simplicial complexes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4148000
@@ Property / cites work: Q4148000 / rank @@
+Normal rank
@@ Property / cites work @@
+Isomorphism Testing in Hookup Classes
@@ Property / cites work: Isomorphism Testing in Hookup Classes / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Time Algorithm for Deciding Interval Graph Isomorphism
+Normal rank
@@ Property / cites work @@
+Isomorphism of graphs of bounded valence can be tested in polynomial time
+Normal rank
@@ Property / cites work @@
+On simple characterizations of k-trees
@@ Property / cites work: On simple characterizations of k-trees / rank @@
+Normal rank
@@ Property / cites work @@
+Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(90)90011-l
+Normal rank
@@ Property / OpenAlex ID @@
+W1983937448
@@ Property / OpenAlex ID: W1983937448 / rank @@
+Normal rank