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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Properties and characterizations of <i>k</i> ‐trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic simplicial complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4148000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism Testing in Hookup Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for Deciding Interval Graph Isomorphism / 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: On simple characterizations of k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank
 
Normal rank

Revision as of 14:50, 20 June 2024

scientific article
Language Label Description Also known as
English
Isomorphism testing of k-trees is in NC, for fixed k
scientific article

    Statements

    Identifiers