Paper Info
Title
Vector Domination in split-indifference graphs
Abstract
•We present an O(n)-time algorithm for Vector Domination in split-indifference graphs.•Cases of the algorithm are based on a structural characterization of such graphs.•The O(n)-time complexity is achieved by appropriate manipulation of data structures.
Year
DOI
Venue
2020
10.1016/j.ipl.2019.105899
Information Processing Letters
Keywords
Field
DocType
Vector Domination problem,Graph algorithms,Split-indifference graph,Split graph,Unit interval graph
Integer,Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Mathematics
Journal
Volume
ISSN
Citations 
155
0020-0190
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Rodrigo L. Mafort100.34
Fábio Protti235746.14