Mathematical Foundations of Computer Science 2005
From MaRDI portal
Publication:5492869
DOI10.1007/11549345zbMath1156.92317OpenAlexW2494705596MaRDI QIDQ5492869
Stéphane Vialette, Romeo Rizzi, Guillaume Fertin
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11549345
Analysis of algorithms and problem complexity (68Q25) Applications of graph theory (05C90) Biochemistry, molecular biology (92C40)
Related Items (7)
On the ordered list subgraph embedding problems ⋮ Complexity issues in color-preserving graph embeddings ⋮ Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs ⋮ Unnamed Item ⋮ The complexity of locally injective homomorphisms ⋮ Obstructions to locally injective oriented improper colourings ⋮ Finding occurrences of protein complexes in protein-protein interaction graphs
This page was built for publication: Mathematical Foundations of Computer Science 2005
