scientific article; zbMATH DE number 5279387

zbMath1153.05333MaRDI QIDQ5387691

Bill Rosgen, Lorna K. Stewart

Publication date: 27 May 2008

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/issue/view/85/showToc.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Helly propertymaximum clique problempartitioning problemscovering problemsedge clique coverintersection representationmaximum weighted clique problemfew cliquesvertex clique cover

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

On standard quadratic programs with exact and inexact doubly nonnegative relaxations ⋮ Tightening a copositive relaxation for standard quadratic optimization problems ⋮ Geometric representation of graphs in low dimension using axis parallel boxes ⋮ Monopolar graphs: complexity of computing classical graph parameters ⋮ Temporal interval cliques and independent sets ⋮ Cubicity and bandwidth ⋮ Sublinear approximation algorithms for boxicity and related problems ⋮ Algorithms for induced biclique optimization problems ⋮ Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs ⋮ Robust set-membership state estimation; application to underwater robotics ⋮ A constant factor approximation algorithm for boxicity of circular arc graphs ⋮ Coordinate Shadows of Semidefinite and Euclidean Distance Matrices

This page was built for publication: