Bypass strong V-structures and find an isomorphic labelled subgraph in linear time

DOI10.1007/3-540-59071-4_57zbMath1528.68287OpenAlexW1739013558MaRDI QIDQ6184379

Heiko Dörr

Publication date: 5 January 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://refubium.fu-berlin.de/handle/fub188/18557

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Graph grammars and their application to computer science. 4th international workshop, Bremen, Germany, March 5-9, 1990. Proceedings
• An Efficient Algorithm for Graph Isomorphism
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bypass strong V-structures and find an isomorphic labelled subgraph in linear time