On the public citation graph

Independent trees in graphs

https://doi.org/10.1007/bf01202468

0 signed · 73 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.3190110309openalex-snapshot

Vertex‐disjoint paths and edge‐disjoint branchings in directed graphs

inferredcites →https://doi.org/10.1007/bf02582931openalex-snapshot

Paths in graphs, reducing the edge-connectivity only by two

inferredcites →https://doi.org/10.1016/0020-0190(92)90230-sopenalex-snapshot

On independent spanning trees

inferredcites →https://doi.org/10.1016/0196-6774(88)90015-6openalex-snapshot

Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs

inferredcites →https://doi.org/10.1016/s0167-5060(08)70504-1openalex-snapshot

A Reduction Method for Edge-Connectivity in Graphs

inferredcites →https://doi.org/10.1109/sfcs.1984.715910openalex-snapshot

The Multi-Tree Approach To Reliability In Distributed Networks

inferredcites →https://doi.org/10.1137/0201010openalex-snapshot

Depth-First Search and Linear Graph Algorithms

inferredcites →https://doi.org/10.1137/0202012openalex-snapshot

Dividing a Graph into Triconnected Components

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.3190200212openalex-snapshot

Disproof of a conjecture about independent branchings in k‐connected directed graphs

inferred← citeshttps://doi.org/10.1002/net.20460openalex-snapshot

Completely independent spanning trees in torus networks

inferred← citeshttps://doi.org/10.1007/10692760_17openalex-snapshot

Independent Tree Spanners

inferred← citeshttps://doi.org/10.1007/10692760_25openalex-snapshot

A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs

inferred← citeshttps://doi.org/10.1007/3-540-36379-3_21openalex-snapshot

Completely Independent Spanning Trees in Maximal Planar Graphs

inferred← citeshttps://doi.org/10.1007/3-540-40064-8_27openalex-snapshot

A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs

inferred← citeshttps://doi.org/10.1007/3-540-40996-3_15openalex-snapshot

Finding Independent Spanning Trees in Partial k-Trees

inferred← citeshttps://doi.org/10.1007/978-3-030-05057-3_27openalex-snapshot

Towards the Independent Spanning Trees in the Line Graphs of Interconnection Networks

inferred← citeshttps://doi.org/10.1007/978-3-030-44685-7_18openalex-snapshot

Taxonomy of Schemes for Resilient Routing

inferred← citeshttps://doi.org/10.1007/978-3-030-69244-5_8openalex-snapshot

Construction of Completely Independent Spanning Tree Based on Vertex Degree

inferred← citeshttps://doi.org/10.1007/978-3-319-29516-9_22openalex-snapshot

Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees

inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_32openalex-snapshot

Dominators, Directed Bipolar Orders, and Independent Spanning Trees

inferred← citeshttps://doi.org/10.1007/978-3-642-38527-8_26openalex-snapshot

Dominator Certification and Independent Spanning Trees: An Experimental Study

inferred← citeshttps://doi.org/10.1007/978-3-642-40820-5_20openalex-snapshot

Circular Dimensional-Permutations and Reliable Broadcasting for Hypercubes and Möbius Cubes

inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_80openalex-snapshot

The Mondshein Sequence

inferred← citeshttps://doi.org/10.1007/978-981-97-0566-5_26openalex-snapshot

(t, s)-Completely Independent Spanning Trees

inferred← citeshttps://doi.org/10.1007/bfb0045110openalex-snapshot

Independent spanning trees of chordal rings

inferred← citeshttps://doi.org/10.1007/pl00021190openalex-snapshot

Independent Trees in Planar Graphs Independent trees

inferred← citeshttps://doi.org/10.1007/s00373-010-0973-2openalex-snapshot

Spanning Trees: A Survey

inferred← citeshttps://doi.org/10.1007/s00373-023-02688-yopenalex-snapshot

Completely Independent Spanning Trees in Line Graphs

inferred← citeshttps://doi.org/10.1007/s10878-016-0018-8openalex-snapshot

Construction independent spanning trees on locally twisted cubes in parallel

inferred← citeshttps://doi.org/10.1007/s11227-009-0363-9openalex-snapshot

Optimal Independent Spanning Trees on Odd Graphs

inferred← citeshttps://doi.org/10.1007/s11227-013-0883-1openalex-snapshot

Parallel construction of independent spanning trees and an application in diagnosis on Möbius cubes

inferred← citeshttps://doi.org/10.1007/s11227-014-1346-zopenalex-snapshot

A fully parallelized scheme of constructing independent spanning trees on Möbius cubes

inferred← citeshttps://doi.org/10.1016/j.dam.2019.09.021openalex-snapshot

An improved algorithm to construct edge-independent spanning trees in augmented cubes

inferred← citeshttps://doi.org/10.1016/j.disc.2004.12.005openalex-snapshot

Disjoint paths in arborescences

inferred← citeshttps://doi.org/10.1016/j.disc.2012.11.006openalex-snapshot

Independent arborescences in directed graphs

inferred← citeshttps://doi.org/10.1016/j.eswa.2016.06.002openalex-snapshot

Connected-component labeling based on hypercubes for memory constrained scenarios

inferred← citeshttps://doi.org/10.1016/j.future.2018.02.010openalex-snapshot

Constructing independent spanning trees with height n on the n -dimensional crossed cube

inferred← citeshttps://doi.org/10.1016/j.ins.2011.02.012openalex-snapshot

Independent spanning trees on even networks

inferred← citeshttps://doi.org/10.1016/j.ins.2013.01.010openalex-snapshot

Independent spanning trees in crossed cubes

inferred← citeshttps://doi.org/10.1016/j.jcss.2017.06.006openalex-snapshot

Biconnectivity, st-numbering and other applications of DFS using O(n) bits

inferred← citeshttps://doi.org/10.1016/j.jpdc.2011.09.002openalex-snapshot

Independent spanning trees on twisted cubes

inferred← citeshttps://doi.org/10.1016/j.jpdc.2012.07.003openalex-snapshot

An efficient parallel construction of optimal independent spanning trees on hypercubes

inferred← citeshttps://doi.org/10.1016/j.jpdc.2019.08.006openalex-snapshot

Constructing node-independent spanning trees on the line graph of the hypercube by an independent forest scheme

inferred← citeshttps://doi.org/10.1016/j.parco.2006.12.001openalex-snapshot

Parallel construction of optimal independent spanning trees on hypercubes

inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.061openalex-snapshot

Constructing independent spanning trees for locally twisted cubes

inferred← citeshttps://doi.org/10.1016/j.tcs.2012.08.020openalex-snapshot

An algorithm to construct independent spanning trees on parity cubes

inferred← citeshttps://doi.org/10.1016/j.tcs.2017.01.016openalex-snapshot

Edge-independent spanning trees in augmented cubes

inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00338-0openalex-snapshot

Independent branchings in acyclic diagraphs

inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00205-1openalex-snapshot

Independent spanning trees of chordal rings

inferred← citeshttps://doi.org/10.1016/s0020-0255(01)00121-9openalex-snapshot

Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security

inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00223-7openalex-snapshot

Independent tree spanners: fault-tolerant spanning trees with constant distance guarantees

inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00269-9openalex-snapshot

Independent spanning trees with small depths in iterated line digraphs

inferred← citeshttps://doi.org/10.1109/csae.2011.5952464openalex-snapshot

Construction of independent spanning trees on twisted-cubes

inferred← citeshttps://doi.org/10.1109/i-span.2009.97openalex-snapshot

Constructing Independent Spanning Trees for Hypercubes and Locally Twisted Cubes

inferred← citeshttps://doi.org/10.1109/icc.2010.5502526openalex-snapshot

Resilient Multipath Routing with Independent Directed Acyclic Graphs

inferred← citeshttps://doi.org/10.1109/infcom.2013.6567179openalex-snapshot

Trade-off analysis of multi topology routing based IP fast reroute mechanisms

inferred← citeshttps://doi.org/10.1109/infcomw.2013.6562911openalex-snapshot

Trade-off analysis of Multi Topology Routing based IP fast reroute mechanisms

inferred← citeshttps://doi.org/10.1109/paap54281.2021.9720456openalex-snapshot

A Parallel Algorithm to Construct Node-Independent Spanning Trees on the Line Graph of Locally Twisted Cube

inferred← citeshttps://doi.org/10.1109/tnet.2011.2161329openalex-snapshot

Independent Directed Acyclic Graphs for Resilient Multipath Routing

inferred← citeshttps://doi.org/10.1109/tnet.2015.2440179openalex-snapshot

IP Fast Rerouting and Disjoint Multipath Routing With Three Edge-Independent Spanning Trees

inferred← citeshttps://doi.org/10.1109/tpds.2014.2307871openalex-snapshot

Dimensional-Permutation-Based Independent Spanning Trees in Bijective Connection Networks

inferred← citeshttps://doi.org/10.1137/17m1134056openalex-snapshot

Four Edge-Independent Spanning Trees

inferred← citeshttps://doi.org/10.1137/s0097539703436734openalex-snapshot

Finding Four Independent Trees

inferred← citeshttps://doi.org/10.1137/s089548010139518xopenalex-snapshot

Nonseparating Cycles in 4-Connected Graphs

inferred← citeshttps://doi.org/10.1137/s0895480103434580openalex-snapshot

Nonseparating Planar Chains in 4-Connected Graphs

inferred← citeshttps://doi.org/10.1137/s0895480103434592openalex-snapshot

Chain Decompositions of 4-Connected Graphs

inferred← citeshttps://doi.org/10.1145/2764913openalex-snapshot

Dominator Tree Certification and Divergent Spanning Trees

inferred← citeshttps://doi.org/10.15623/ijret.2013.0208029openalex-snapshot

A NOVEL SCHEME FOR RELIABLE MULTIPATH ROUTING THROUGH NODE-INDEPENDENT DIRECTED ACYCLIC GRAPHS

inferred← citeshttps://doi.org/10.1587/transfun.2024dmp0012openalex-snapshot

(t, s)-Completely Independent Spanning Trees

inferred← citeshttps://doi.org/10.2139/ssrn.7507519openalex-snapshot

Completely Independent Steiner Trees

inferred← citeshttps://doi.org/10.3311/pp.ee.2010-1-2.04openalex-snapshot

Finding multiple maximally redundant trees in linear time

inferred← citeshttps://doi.org/10.48550/arxiv.1210.8303openalex-snapshot

Dominator Tree Certification and Independent Spanning Trees

inferred← citeshttps://doi.org/10.5555/644108.644140openalex-snapshot

Chain decompositions and independent trees in 4-connected 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.