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

Discrete Applied Mathematics - Netherlands
doi 10.1016/j.dam.2008.02.015
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

The Paired-Domination and the Upper Paired-Domination Numbers of Graphs

Opuscula Mathematica
Mathematics
2015English

Connected Domination Polynomial of Graphs

Fasciculi Mathematici
2018English

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

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2004English

Connected Domination Polynomial of Some Graphs

IOSR Journal of Mathematics
2016English

The 2-Tuple Domination Problem on Circular-Arc Graphs

Journal of Mathematics and Informatics
2017English

An Expected Polynomial Time Algorithm for Coloring 2-Colorable 3-Graphs

Electronic Notes in Discrete Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2009English

A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2017English

The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

A Polynomial Time Algorithm for Fault Diagnosability

1984English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy