Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Publication:5897557
DOI10.1007/11604686zbMath1171.68635MaRDI QIDQ5897557
Leonidas Palios, Stavros D. Nikolopoulos
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)
Related Items (5)
Characterizing and Computing Minimal Cograph Completions ⋮ Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs ⋮ Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs ⋮ Characterizing and computing minimal cograph completions ⋮ Dynamically maintaining split graphs
This page was built for publication: Graph-Theoretic Concepts in Computer Science