Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs
Sign Up to like & getrecommendations! Published in 2022 at "Algorithmica"
DOI: 10.1007/s00453-021-00904-w
Abstract: A bipartite graph $$G=(U,V,E)$$ G = ( U , V , E ) is convex if the vertices in V can be linearly ordered such that for each vertex $$u\in U$$ u ∈ U ,… read more here.
Keywords: time; minimum chain; chain; convex bipartite ... See more keywords
Algorithmic aspects of Roman domination in graphs
Sign Up to like & getrecommendations! Published in 2020 at "Journal of Applied Mathematics and Computing"
DOI: 10.1007/s12190-020-01345-4
Abstract: For a simple, undirected graph $$G = (V, E)$$ G = ( V , E ) , a Roman dominating function (RDF) $$f{:}V \rightarrow \lbrace 0, 1, 2 \rbrace $$ f : V → {… read more here.
Keywords: convex bipartite; graphs; bipartite graphs; roman domination ... See more keywords