Computing metric hulls in graphs

We prove that, given a closure function the smallest preimage of a closed set can be calculated in polynomial time in the number of closed sets. This implies that there is a polynomial time algorithm to compute the convex hull number of a graph, when all its convex subgraphs are given as input. We t...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete Mathematics and Theoretical Computer Science Vol. 21 no. 1, ICGT 2018; no. 1; pp. COV1 - 20
Main Authors:	Knauer, Kolja, Nisse, Nicolas
Format:	Journal Article
Language:	English
Published:	Nancy DMTCS 01.05.2019 Discrete Mathematics & Theoretical Computer Science
Subjects:	[info.info-cc]computer science [cs]/computational complexity [cs.cc] Algorithms Apexes Applied research Completeness Complexity theory Computational Complexity Computational geometry Computer Science Convexity Graph theory Graphs Hulls Polynomials Set theory Shortest-path problems France
ISSN:	1365-8050, 1462-7264, 1365-8050
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!