scientific article
From MaRDI portal
Publication:2934605
zbMath1302.05179MaRDI QIDQ2934605
Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz
Publication date: 18 December 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (9)
Recognizing \(d\)-interval graphs and \(d\)-track interval graphs ⋮ Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes ⋮ On the parameterized complexity of some optimization problems related to multiple-interval graphs ⋮ Extracting constrained 2-interval subsets in 2-interval sets ⋮ Optimization problems in multiple subtree graphs ⋮ Approximation algorithm for coloring of dotted interval graphs ⋮ Minimum vertex cover in rectangle graphs ⋮ On the parameterized complexity of multiple-interval graph problems ⋮ The maximum clique problem in multiple interval graphs
This page was built for publication:
