Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Algorithms by layer-decomposition for the subgraph recognition problem with attributes

From MaRDI portal
Publication:2386613
Jump to:navigation, search

DOI10.3934/JIMO.2005.1.337zbMATH Open1077.05093OpenAlexW2315766964MaRDI QIDQ2386613FDOQ2386613


Authors: Yifan Xu Edit this on Wikidata


Publication date: 1 September 2005

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2005.1.337




Recommendations

  • scientific article; zbMATH DE number 2117153
  • A layer-decomposition with degree method for subgraphs recognition problem.
  • Subgraph Isomorphism in Planar Graphs and Related Problems
  • Planar subgraph isomorphism revisited
  • Publication:4886099


zbMATH Keywords

planar graphs


Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)



Cited In (3)

  • Assessing the computational complexity of multi-layer subgraph detection
  • Title not available (Why is that?)
  • A layer-decomposition with degree method for subgraphs recognition problem.





This page was built for publication: Algorithms by layer-decomposition for the subgraph recognition problem with attributes

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2386613&oldid=15022363"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 2 February 2024, at 19:04. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki