scientific article; zbMATH DE number 2080986

zbMATH Open1077.05510MaRDI QIDQ4474083FDOQ4474083

Authors: Takayuki Nagoya 

Publication date: 4 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2223/22230136.htm

Title of this publication is not available (Why is that?)

Recommendations

• A linear-time algorithm for isomorphism of a subclass of chordal graphs
• Counting the number of independent sets in chordal graphs
• Graph-Theoretic Concepts in Computer Science
• Counting the number of matchings in chordal and chordal bipartite graph classes

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cited In (2)

• The isomorphism problem for \(k\)-trees is complete for logspace
• A linear-time algorithm for isomorphism of a subclass of chordal graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474083)