On the public citation graph

A Novel Hybrid Algorithm for Minimum Total Dominating Set Problem

0 signed · 30 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/s11432-013-4793-xopenalex-snapshot
Steganalysis by subtractive pixel adjacency matrix and dimensionality reduction
inferredcites →https://doi.org/10.1007/s11432-013-5052-xopenalex-snapshot
An upper (lower) bound for Max (Min) CSP
inferredcites →https://doi.org/10.1007/s11590-006-0031-4openalex-snapshot
TTT plots: a perl program to create time-to-target plots
inferredcites →https://doi.org/10.1016/j.asoc.2016.09.040openalex-snapshot
The evolutionary cost of Baldwin effect in the routing and spectrum allocation problem in elastic optical networks
inferredcites →https://doi.org/10.1016/j.ins.2017.12.012openalex-snapshot
New heuristic approaches for maximum balanced biclique problem
inferredcites →https://doi.org/10.1090/dimacs/026openalex-snapshot
Cliques, Coloring, and Satisfiability
inferredcites →https://doi.org/10.1109/jsac.2006.881606openalex-snapshot
Gateway Placement Optimization in Wireless Mesh Networks With QoS Constraints
inferredcites →https://doi.org/10.1109/sahcn.2004.1381907openalex-snapshot
Efficacy of misuse detection in adhoc networks
inferredcites →https://doi.org/10.1111/itor.12614openalex-snapshot
MLQCC: an improved local search algorithm for the set k ‐covering problem
inferredcites →https://doi.org/10.1145/1655925.1655948openalex-snapshot
Approximation for minimum total dominating set
inferredcites →https://doi.org/10.1145/513800.513821openalex-snapshot
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
inferredcites →https://doi.org/10.1609/aaai.v30i1.10067openalex-snapshot
Two Efficient Local Search Algorithms for Maximum Weight Clique Problem
inferredcites →https://doi.org/10.1613/jair.3907openalex-snapshot
NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover
inferredcites →https://doi.org/10.1613/jair.5205openalex-snapshot
Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function
inferredcites →https://doi.org/10.1613/jair.5443openalex-snapshot
Finding A Small Vertex Cover in Massive Sparse Graphs: Construct, Local Search, and Preprocess
inferredcites →https://doi.org/10.24963/ijcai.2018/210openalex-snapshot
A Fast Local Search Algorithm for Minimum Weight Dominating Set Problem on Massive Graphs
inferredcites →https://doi.org/10.3390/app8020293openalex-snapshot
Parallel Technique for the Metaheuristic Algorithms Using Devoted Local Search and Manipulating the Solutions Space

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-032-04700-7_21openalex-snapshot
On the Parameterized Complexity of Cosecure Domination
inferred← citeshttps://doi.org/10.1007/978-981-16-7182-1_4openalex-snapshot
Minimum Weight Dominating Set Using Chemical Reaction Optimization Algorithm
inferred← citeshttps://doi.org/10.1007/s10489-021-02305-6openalex-snapshot
Towards efficient local search for the minimum total dominating set problem
inferred← citeshttps://doi.org/10.1088/1742-6596/1832/1/012020openalex-snapshot
On resolving total dominating set of sunlet graphs
inferred← citeshttps://doi.org/10.1145/3583133.3590607openalex-snapshot
Variable neighborhood search for solving the k-domination problem
inferred← citeshttps://doi.org/10.1155/2019/8640218openalex-snapshot
A Novel Selection Approach for Genetic Algorithms for Global Optimization of Multimodal Continuous Functions
inferred← citeshttps://doi.org/10.1155/2023/9640807openalex-snapshot
Chemical Reaction Optimization for Minimum Weight Dominating Set
inferred← citeshttps://doi.org/10.3390/a14030079openalex-snapshot
An Improved Greedy Heuristic for the Minimum Positive Influence Dominating Set Problem in Social Networks
inferred← citeshttps://doi.org/10.3390/axioms12060506openalex-snapshot
An Approximation Algorithm for a Variant of Dominating Set Problem
inferred← citeshttps://doi.org/10.3390/math8071155openalex-snapshot
Improved Memetic Algorithm for Solving the Minimum Weight Vertex Independent Dominating Set
inferred← citeshttps://doi.org/10.3390/math8091551openalex-snapshot
Solving the Capacitated Vertex K-Center Problem through the Minimum Capacitated Dominating Set Problem
inferred← citeshttps://doi.org/10.3390/math8111858openalex-snapshot
Barrakuda: A Hybrid Evolutionary Algorithm for Minimum Capacitated Dominating Set Problem
inferred← citeshttps://doi.org/10.3390/math9040361openalex-snapshot
Adding Negative Learning to Ant Colony Optimization: A Comprehensive Study
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.