On the public citation graph
Minimal feedback vertex sets in directed split‐stars
0 signed · 42 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1097-0037(200003)35:2<139::aid-net4>3.0.co;2-eopenalex-snapshot
Orienting split-stars and alternating group graphs
inferredcites →https://doi.org/10.1006/jpdc.1996.0059openalex-snapshot
A Self-Stabilizing Leader Election Algorithm for Tree Graphs
inferredcites →https://doi.org/10.1006/jpdc.2001.1833openalex-snapshot
A Stabilizing Algorithm for Finding Biconnected Components
inferredcites →https://doi.org/10.1007/978-1-4471-3886-0openalex-snapshot
Digraphs Theory Algorithms And Applications
inferredcites →https://doi.org/10.1007/bf02278856openalex-snapshot
A self-stabilizing algorithm for coloring planar graphs
inferredcites →https://doi.org/10.1007/pl00009191openalex-snapshot
Approximating Minimum Feedback Sets and Multicuts in Directed Graphs
inferredcites →https://doi.org/10.1007/pl00009810openalex-snapshot
Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs
inferredcites →https://doi.org/10.1007/s002360050088openalex-snapshot
Minimum feedback vertex sets in cocomparability graphs and convex bipartite graphs
inferredcites →https://doi.org/10.1016/j.ipl.2003.11.001openalex-snapshot
Feedback vertex sets in star graphs
inferredcites →https://doi.org/10.1016/s0020-0190(00)00127-7openalex-snapshot
Feedback vertex set in hypercubes
inferredcites →https://doi.org/10.1016/s0020-0190(02)00266-1openalex-snapshot
New bounds on the size of the minimum feedback vertex set in meshes and butterflies
inferredcites →https://doi.org/10.1016/s0020-0190(96)00193-7openalex-snapshot
A linear-time algorithm for the weighted feedback vertex problem on interval graphs
inferredcites →https://doi.org/10.1016/s0020-0190(98)00039-8openalex-snapshot
Almost exact minimum feedback vertex set in meshes and butterflies
inferredcites →https://doi.org/10.1016/s0743-7315(02)00028-xopenalex-snapshot
A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks
inferredcites →https://doi.org/10.1016/s0743-7315(03)00040-6openalex-snapshot
Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars
inferredcites →https://doi.org/10.1109/12.21148openalex-snapshot
A group-theoretic model for symmetric interconnection networks
inferredcites →https://doi.org/10.1137/0208051openalex-snapshot
A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs
inferredcites →https://doi.org/10.1137/s0097539798338163openalex-snapshot
An Approximation Algorithm for Feedback Vertex Sets in Tournaments
inferredcites →https://doi.org/10.1137/s0895480196305124openalex-snapshot
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
inferredcites →https://doi.org/10.1145/3149.3159openalex-snapshot
Feedback vertex sets and cyclically reducible graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/j.asoc.2022.109607openalex-snapshot
Stochastic simulated annealing for directed feedback vertex set
inferred← citeshttps://doi.org/10.1016/j.camwa.2009.10.021openalex-snapshot
Feedback numbers of de Bruijn digraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2008.02.002openalex-snapshot
An efficient distributed algorithm for canonical labeling on directed split-stars
inferred← citeshttps://doi.org/10.1016/j.disc.2006.09.010openalex-snapshot
Feedback numbers of Kautz digraphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2014.09.013openalex-snapshot
On the decycling number of generalized Kautz digraphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.10.046openalex-snapshot
Conditional diagnosability and strong diagnosability of Split-Star Networks under the PMC model
inferred← citeshttps://doi.org/10.1051/itmconf/20192501012openalex-snapshot
Feedback Numbers of Goldberg Snark, Twisted Goldberg Snarks and Related Graphs
inferred← citeshttps://doi.org/10.1051/itmconf/20192501013openalex-snapshot
Feedback Numbers of Möbius Ladders
inferred← citeshttps://doi.org/10.1080/00207160.2010.495154openalex-snapshot
Conditional matching preclusion for the alternating group graphs and split-stars
inferred← citeshttps://doi.org/10.1080/00207160802676554openalex-snapshot
A note on leader election in directed split-stars and directed alternating group graphs
inferred← citeshttps://doi.org/10.1109/cis.2014.79openalex-snapshot
Improved Feedback Vertex Sets in Kautz Digraphs K (d, n)
inferred← citeshttps://doi.org/10.1109/cis.2017.00039openalex-snapshot
Decycling Number of Crossed Cubes CQn
inferred← citeshttps://doi.org/10.1109/cis2018.2018.00103openalex-snapshot
Feedback Numbers of Balanced Hypercubes BH_n
inferred← citeshttps://doi.org/10.1109/icctd.2009.215openalex-snapshot
Feedback Arc Set in Oriented Graphs
inferred← citeshttps://doi.org/10.1109/tpds.2015.2400459openalex-snapshot
The Extra, Restricted Connectivity and Conditional Diagnosability of Split-Star Networks
inferred← citeshttps://doi.org/10.1142/s0129054112500116openalex-snapshot
MINIMUM FEEDBACK ARC SETS IN ROTATOR AND INCOMPLETE ROTATOR GRAPHS
inferred← citeshttps://doi.org/10.1142/s0219265911003003openalex-snapshot
STRONG MATCHING PRECLUSION FOR THE ALTERNATING GROUP GRAPHS AND SPLIT-STARS
inferred← citeshttps://doi.org/10.1142/s1793830914500335openalex-snapshot
The decycling number of $P_{m} \square P_{n}^{\ast}$
inferred← citeshttps://doi.org/10.1142/s1793830917500628openalex-snapshot
New bounds on the decycling number of generalized de Bruijn digraphs
inferred← citeshttps://doi.org/10.11650/twjm/1500406287openalex-snapshot
Bounds on Feedback Numbers of de Bruijn Graphs
inferred← citeshttps://doi.org/10.12732/ijpam.v93i4.5openalex-snapshot
FEEDBACK NUMBERS OF FLOWER SNARK AND RELATED GRAPHS
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.