On Independence Domination

DOI10.1007/978-3-642-40164-0_19zbMath1390.68348DBLPconf/fct/HonKLPW13arXiv1304.6450OpenAlexW1578250942WikidataQ62041773 ScholiaQ62041773MaRDI QIDQ2842784

Wing-Kai Hon, Hsiang-Hsuan Liu, Yue-Li Wang, Ton Kloks, Sheung-Hung Poon

Publication date: 16 August 2013

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.6450

zbMATH Keywords

dominationdistance-hereditary graphexact algorithmpermutation graphcographindependence domination

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 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) Approximation algorithms (68W25)

Related Items (1)

Strong triadic closure in cographs and graphs of low maximum degree

This page was built for publication: On Independence Domination