On the public citation graph

Scheduling File Transfers for Trees and Odd Cycles

https://doi.org/10.1137/0216013
0 signed · 31 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/bf01762116openalex-snapshot
Data transfers in networks
inferredcites →https://doi.org/10.1109/tcom.1982.1095433openalex-snapshot
An Optimal Switching Algorithm for Multibeam Satellite Systems with Variable Bandwidth Beams
inferredcites →https://doi.org/10.1137/0214054openalex-snapshot
Scheduling File Transfers

What points at this work

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

inferred← citeshttps://doi.org/10.1002/net.20190openalex-snapshot
Some results about f‐critical graphs
inferred← citeshttps://doi.org/10.1002/net.3230220606openalex-snapshot
Scheduling file transfers in fully connected networks
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0057openalex-snapshot
On-Line Routing of Real-Time Messages
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1500openalex-snapshot
Complexity and Approximations for Multimessage Multicasting
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1506openalex-snapshot
Routing and Scheduling I/O Transfers on Wormhole-Routed Mesh Networks
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_39openalex-snapshot
File Transfer Tree Problems
inferred← citeshttps://doi.org/10.1007/3-540-54945-5_48openalex-snapshot
Scheduling file transfers under port and channel constraints
inferred← citeshttps://doi.org/10.1007/978-0-585-27268-9_6openalex-snapshot
On Wavelength Assignment in WDM Optical Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-72588-6_59openalex-snapshot
A Class of Graphs of f-Class 1
inferred← citeshttps://doi.org/10.1007/bf01762116openalex-snapshot
Data transfers in networks
inferred← citeshttps://doi.org/10.1007/bfb0030112openalex-snapshot
Multi-Message Multicasting
inferred← citeshttps://doi.org/10.1007/s004530010072openalex-snapshot
Simple Algorithms for Multimessage Multicasting with Forwarding
inferred← citeshttps://doi.org/10.1016/j.aml.2007.02.009openalex-snapshot
Some graphs of class 1 for f -colorings
inferred← citeshttps://doi.org/10.1016/j.ipl.2018.02.004openalex-snapshot
On f-colorings of nearly bipartite graphs
inferred← citeshttps://doi.org/10.1080/00207160903033648openalex-snapshot
Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles
inferred← citeshttps://doi.org/10.1080/00207160903349572openalex-snapshot
On the fractionalf-chromatic index of a graph
inferred← citeshttps://doi.org/10.1109/12.256452openalex-snapshot
Data transfers in broadcast networks
inferred← citeshttps://doi.org/10.1109/31.1747openalex-snapshot
On the f-coloring of multigraphs
inferred← citeshttps://doi.org/10.1109/emwrt.1989.43456openalex-snapshot
Routing messages with release time and deadline constraints
inferred← citeshttps://doi.org/10.1109/hicss.1997.667217openalex-snapshot
Multimessage multicasting: complexity and approximations
inferred← citeshttps://doi.org/10.1109/icacte.2010.5579689openalex-snapshot
Some results of f-critical graph
inferred← citeshttps://doi.org/10.1109/mppoi.1998.682142openalex-snapshot
Scheduling file transfers in WDM optical networks
inferred← citeshttps://doi.org/10.1109/real.1990.128738openalex-snapshot
On-line routing of real-time messages
inferred← citeshttps://doi.org/10.1137/0219015openalex-snapshot
The Complexity of File Transfer Scheduling with Forwarding
inferred← citeshttps://doi.org/10.1142/s0219265900000184openalex-snapshot
DISTRIBUTED ALGORITHM FOR MULTIMESSAGE MULTICASTING
inferred← citeshttps://doi.org/10.1287/mnsc.36.8.958openalex-snapshot
Accumulation Point Location on Tree Networks for Guaranteed Time Distribution
inferred← citeshttps://doi.org/10.7151/dmgt.1842openalex-snapshot
M_2-edge colorings of cacti and graph joins
inferred← citeshttps://doi.org/10.7494/opmath.2015.35.3.287openalex-snapshot
A note on M2-edge colorings of 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.