On the public citation graph

Linear Programming and the Worst-Case Analysis of Greedy Algorithms on Cubic Graphs

0 signed · 49 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.1002/jgt.20568openalex-snapshot
Domination number of cubic graphs with large girth
inferredcites →https://doi.org/10.1002/jgt.3190130604openalex-snapshot
Spanning trees with many leaves in cubic graphs
inferredcites →https://doi.org/10.1002/rsa.10047openalex-snapshot
Minimum independent dominating sets of random cubic graphs
inferredcites →https://doi.org/10.1002/rsa.3240070303openalex-snapshot
The dominating number of a random cubic graph
inferredcites →https://doi.org/10.1006/jagm.1998.0944openalex-snapshot
Approximating Maximum Leaf Spanning Trees in Almost Linear Time
inferredcites →https://doi.org/10.1007/10719839_2openalex-snapshot
Small Maximal Matchings in Random Graphs
inferredcites →https://doi.org/10.1007/3-540-61680-2_55openalex-snapshot
Approximation algorithms for connected dominating sets
inferredcites →https://doi.org/10.1007/3-540-68530-8_37openalex-snapshot
2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves
inferredcites →https://doi.org/10.1007/s00026-012-0155-4openalex-snapshot
On the Independent Domination Number of Regular Graphs
inferredcites →https://doi.org/10.1007/s00373-007-0770-8openalex-snapshot
Domination in Graphs of Minimum Degree at least Two and Large Girth
inferredcites →https://doi.org/10.1016/0012-365x(83)90273-xopenalex-snapshot
A note on the independence number of triangle-free graphs
inferredcites →https://doi.org/10.1016/0020-0190(93)90022-2openalex-snapshot
Approximating the minimum maximal independence number
inferredcites →https://doi.org/10.1016/0020-0190(94)90139-2openalex-snapshot
A short note on the approximability of the maximum leaves spanning tree problem
inferredcites →https://doi.org/10.1016/0095-8956(91)90080-4openalex-snapshot
A note on the independence number of triangle-free graphs, II
inferredcites →https://doi.org/10.1016/j.disc.2007.12.009openalex-snapshot
An upper bound on the domination number of n -vertex connected cubic graphs
inferredcites →https://doi.org/10.1016/j.entcs.2003.12.005openalex-snapshot
Small Edge Dominating Sets of Regular Graphs
inferredcites →https://doi.org/10.1016/j.jctb.2007.02.006openalex-snapshot
Large independent sets in regular graphs of large girth
inferredcites →https://doi.org/10.1016/j.jda.2004.05.001openalex-snapshot
On the approximability of the maximum induced matching problem
inferredcites →https://doi.org/10.1016/s0012-365x(98)00350-1openalex-snapshot
On independent domination number of regular graphs
inferredcites →https://doi.org/10.1016/s0304-3975(02)00653-9openalex-snapshot
Small maximal matchings in random graphs
inferredcites →https://doi.org/10.1016/s0898-1221(00)90183-4openalex-snapshot
Complexity and approximation: Combinatorial optimization problems and their approximability properties
inferredcites →https://doi.org/10.1016/s1570-8667(03)00007-8openalex-snapshot
A PTAS for the sparsest 2-spanner of 4-connected planar triangulations
inferredcites →https://doi.org/10.1016/s1571-0653(04)00119-2openalex-snapshot
The Domination Number of Cubic Graphs with Girth at least Five
inferredcites →https://doi.org/10.1017/s0963548300002042openalex-snapshot
Paths, Stars and the Number Three
inferredcites →https://doi.org/10.1057/jors.1981.83openalex-snapshot
Post Optimal Analyses, Parametric Programming and Related Topics
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.1137/0138030openalex-snapshot
Edge Dominating Sets in Graphs
inferredcites →https://doi.org/10.1137/0406030openalex-snapshot
Minimum Edge Dominating Sets
inferredcites →https://doi.org/10.1515/9783110871203openalex-snapshot
Postoptimal Analyses, Parametric Programming, and Related Topics: Degeneracy, Multicriteria Decision Making, Redundancy
inferredcites →https://doi.org/10.2140/pjm.1975.61.225openalex-snapshot
Relations between packing and covering numbers of a tree
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.37236/1189openalex-snapshot
The independence number of graphs with large odd girth
inferredcites →https://doi.org/10.37236/1624openalex-snapshot
Minimum Connected Dominating Sets of Random Cubic Graphs
inferredcites →https://doi.org/10.82444/warw.33642091openalex-snapshot
Randomised techniques in combinatorial algorithmics

What points at this work

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

inferred← citeshttps://doi.org/10.1002/jgt.22968openalex-snapshot
A tight bound for independent domination of cubic graphs without 4‐cycles
inferred← citeshttps://doi.org/10.1007/11611257_54openalex-snapshot
Small Independent Edge Dominating Sets in Graphs of Maximum Degree Three
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_44openalex-snapshot
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-30140-0_19openalex-snapshot
Approximation Hardness of Dominating Set Problems
inferred← citeshttps://doi.org/10.1007/s00026-012-0155-4openalex-snapshot
On the Independent Domination Number of Regular Graphs
inferred← citeshttps://doi.org/10.1007/s00373-014-1454-9openalex-snapshot
A Structural Approach for Independent Domination of Regular Graphs
inferred← citeshttps://doi.org/10.1007/s10878-006-7908-0openalex-snapshot
Approximation hardness of edge dominating set problems
inferred← citeshttps://doi.org/10.1007/s10878-011-9439-6openalex-snapshot
Independent dominating sets in regular graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2024.04.010openalex-snapshot
Full degree spanning trees in random regular graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2008.05.029openalex-snapshot
Connected domination of regular graphs
inferred← citeshttps://doi.org/10.1017/s0963548304006108openalex-snapshot
On the $b$-Independence Number of Sparse Random Graphs
inferred← citeshttps://doi.org/10.37236/1624openalex-snapshot
Minimum Connected Dominating Sets of Random Cubic Graphs
inferred← citeshttps://doi.org/10.37236/9963openalex-snapshot
Minimum Maximal Matchings in Cubic Graphs
inferred← citeshttps://doi.org/10.3926/jotse.755openalex-snapshot
Student model initialization using domain knowledge ontology representative subset
inferred← citeshttps://doi.org/10.48550/arxiv.2112.11720openalex-snapshot
Tight bound for independent domination of cubic graphs without $4$-cycles
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.