On the public citation graph

Minimum Weakly Fundamental Cycle Bases Are Hard To Find

https://doi.org/10.1007/s00453-007-9112-8
0 signed · 51 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/(sici)1097-0118(199805)28:1<1::aid-jgt1>3.0.co;2-qopenalex-snapshot
Hypothetical complexity of the nowhere-zero 5-flow problem
inferredcites →https://doi.org/10.1002/9781119005353.ch13openalex-snapshot
Inapproximability of Combinatorial Optimization Problems
inferredcites →https://doi.org/10.1002/andp.18471481202openalex-snapshot
Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird
inferredcites →https://doi.org/10.1007/11786986_23openalex-snapshot
A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
inferredcites →https://doi.org/10.1007/3-540-45471-3_21openalex-snapshot
A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_5openalex-snapshot
On the Abstract Properties of Linear Dependence1
inferredcites →https://doi.org/10.1007/978-1-4612-0619-4openalex-snapshot
Modern Graph Theory
inferredcites →https://doi.org/10.1007/978-3-540-24592-6_12openalex-snapshot
On the Approximability of the Minimum Fundamental Cycle Basis Problem
inferredcites →https://doi.org/10.1007/978-3-540-24838-5_2openalex-snapshot
Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_71openalex-snapshot
A Faster Algorithm for Minimum Cycle Basis of Graphs
inferredcites →https://doi.org/10.1007/978-3-540-31856-9_54openalex-snapshot
A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
inferredcites →https://doi.org/10.1007/978-3-540-39658-1_64openalex-snapshot
Finding Short Integral Cycle Bases for Cyclic Timetabling
inferredcites →https://doi.org/10.1007/s00453-004-1098-xopenalex-snapshot
Minimum Cycle Bases for Network Graphs
inferredcites →https://doi.org/10.1016/0012-365x(88)90226-9openalex-snapshot
On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
inferredcites →https://doi.org/10.1016/j.dam.2006.06.007openalex-snapshot
Classes of cycle bases
inferredcites →https://doi.org/10.1016/j.ipl.2005.01.006openalex-snapshot
A greedy approach to compute a minimum cycle basis of a directed graph
inferredcites →https://doi.org/10.1016/j.ipl.2007.06.013openalex-snapshot
New length bounds for cycle bases
inferredcites →https://doi.org/10.1016/s0196-6774(03)00052-xopenalex-snapshot
Packing cycles in undirected graphs
inferredcites →https://doi.org/10.1016/s0304-3975(98)00158-3openalex-snapshot
Some APX-completeness results for cubic graphs
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1112/plms/s1-32.1.277openalex-snapshot
Second Complément à l'Analysis Situs
inferredcites →https://doi.org/10.1137/0210054openalex-snapshot
The NP-Completeness of Some Edge-Partition Problems
inferredcites →https://doi.org/10.1137/0216026openalex-snapshot
A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
inferredcites →https://doi.org/10.1137/s0097539792224474openalex-snapshot
A Graph-Theoretic Game and Its Application to the k -Server Problem
inferredcites →https://doi.org/10.1145/276698.276725openalex-snapshot
On approximating arbitrary metrices by tree metrics
inferredcites →https://doi.org/10.1145/355984.355988openalex-snapshot
Algorithms for Generating Fundamental Cycles in a Graph
inferredcites →https://doi.org/10.1201/b16132-57openalex-snapshot
Extremal Graph Theory
inferredcites →https://doi.org/10.2307/2371182openalex-snapshot
On the Abstract Properties of Linear Dependence
inferredcites →https://doi.org/10.5486/pmd.1962.9.1-2.02openalex-snapshot
On the maximal number of disjoint circuits of a graph

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.4525587openalex-extracted
Feedback Set Problems on (Planar) Graphs of Bounded Degrees
inferred← citeshttps://doi.org/10.1007/978-3-030-26176-4_27openalex-snapshot
Deconstructing Parameterized Hardness of Fair Vertex Deletion Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-21840-3_28openalex-snapshot
Rooted Cycle Bases
inferred← citeshttps://doi.org/10.1007/978-3-540-69903-3_31openalex-snapshot
On a Special Co-cycle Basis of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_44openalex-snapshot
New Approximation Algorithms for Minimum Cycle Bases of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-02094-0_2openalex-snapshot
Minimum Cycle Bases and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-13036-6_30openalex-snapshot
Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs
inferred← citeshttps://doi.org/10.1007/978-981-92-3309-0_33openalex-snapshot
Feedback Set Problems on Bounded-Degree (Planar) Graphs
inferred← citeshttps://doi.org/10.1007/s00453-009-9313-4openalex-snapshot
New Approximation Algorithms for Minimum Cycle Bases of Graphs
inferred← citeshttps://doi.org/10.1007/s00453-018-0419-4openalex-snapshot
Structural Parameterizations of Undirected Feedback Vertex Set: FPT Algorithms and Kernelization
inferred← citeshttps://doi.org/10.1007/s10955-016-1566-0openalex-snapshot
Cycle-Based Cluster Variational Method for Direct and Inverse Inference
inferred← citeshttps://doi.org/10.1007/s40314-025-03158-2openalex-snapshot
A note on local convergence of iterative processes for pipe network analysis
inferred← citeshttps://doi.org/10.1016/j.cosrev.2009.08.001openalex-snapshot
Cycle bases in graphs characterization, algorithms, complexity, and applications
inferred← citeshttps://doi.org/10.1016/j.dam.2010.10.014openalex-snapshot
On the approximability of the minimum strictly fundamental cycle basis problem
inferred← citeshttps://doi.org/10.1016/j.dam.2015.12.001openalex-snapshot
Minimum strictly fundamental cycle bases of planar graphs are hard to find
inferred← citeshttps://doi.org/10.1016/j.dam.2021.09.003openalex-snapshot
Target set selection for conservative populations
inferred← citeshttps://doi.org/10.1016/j.disopt.2008.09.003openalex-snapshot
Integral cycle bases for cyclic timetabling
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.11.003openalex-snapshot
Properties of Gomory–Hu co-cycle bases
inferred← citeshttps://doi.org/10.1145/1412228.1498696openalex-snapshot
An improved heuristic for computing short integral cycle bases
inferred← citeshttps://doi.org/10.1145/1644015.1644023openalex-snapshot
Minimum cycle bases
inferred← citeshttps://doi.org/10.4230/oasics.atmos.2021.2openalex-snapshot
Forward Cycle Bases and Periodic Timetabling
inferred← citeshttps://doi.org/10.70675/32d95afcz2181z4f21z9db9z03c282405e87openalex-snapshot
Hitting sets : VC-dimension and Multicut
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.