A Simple Linear Algorithm for the Connected Domination Problem in Circular-Arc Graphs

Discussiones Mathematicae - Graph Theory - Poland
doi 10.7151/dmgt.1220
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Faculty of Mathematics, Computer Science and Econometrics, University of Zielona Gora

Related search

The 2-Tuple Domination Problem on Circular-Arc Graphs

Journal of Mathematics and Informatics
2017English

A Polynomial-Time Algorithm for the Paired-Domination Problem on Permutation Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2009English

Induced Disjoint Paths in Circular-Arc Graphs in Linear Time

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Connected Domination Polynomial of Graphs

Fasciculi Mathematici
2018English

Connected Domination Polynomial of Some Graphs

IOSR Journal of Mathematics
2016English

Algorithmic Aspects of Secure Connected Domination in Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

On Domination Critical Graphs With Cutvertices Having Connected Domination Number 3

International Mathematical Forum
2007English

An Algorithm for the Feedback Vertex Set Problem on a Normal Helly Circular-Arc Graph

Journal of Computer and Communications
2016English

A Linear-Time Algorithm for Broadcast Domination in a Tree

Networks
Information SystemsComputer NetworksHardwareCommunicationsArchitectureSoftware
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy