On the public citation graph
On Edge Coloring Bipartite Graphs
0 signed · 159 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.1007/bf00998632openalex-snapshot
Using euler partitions to edge color bipartite multigraphs
inferredcites →https://doi.org/10.1137/0202019openalex-snapshot
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
inferredcites →https://doi.org/10.1137/0211009openalex-snapshot
Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/047134608x.w7603.pub2openalex-snapshot
Reconfigurable Computing
inferred← citeshttps://doi.org/10.1002/047134608x.w7603.pub3openalex-snapshot
Reconfigurable Computing
inferred← citeshttps://doi.org/10.1002/1520-6750(199502)42:1<141::aid-nav3220420111>3.0.co;2-3openalex-snapshot
Note: Open-shop scheduling with release dates to minimize maximum lateness
inferred← citeshttps://doi.org/10.1002/ett.4460120106openalex-snapshot
Intact versus fractional switching in SONET/SDH cross—connects
inferred← citeshttps://doi.org/10.1002/jgt.22889openalex-snapshot
Edge coloring graphs with large minimum degree
inferred← citeshttps://doi.org/10.1002/jgt.23077openalex-snapshot
The overfull conjecture on graphs of odd order and large minimum degree
inferred← citeshttps://doi.org/10.1002/jgt.3190100202openalex-snapshot
A generalization of edge‐coloring in graphs
inferred← citeshttps://doi.org/10.1002/net.3230240603openalex-snapshot
Applications of matching and edge‐coloring algorithms to routing in clos networks
inferred← citeshttps://doi.org/10.1006/jagm.1999.1058openalex-snapshot
Edge-Coloring Bipartite Graphs
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1483openalex-snapshot
Packet Routing in Fixed-Connection Networks: A Survey
inferred← citeshttps://doi.org/10.1007/1-84628-274-8_1openalex-snapshot
Architectures of Internet Switches and Routers
inferred← citeshttps://doi.org/10.1007/11572961_24openalex-snapshot
Irregular Redistribution Scheduling by Partitioning Messages
inferred← citeshttps://doi.org/10.1007/3-540-12727-5_4openalex-snapshot
Efficient algorithms for finding maximal matching in graphs
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_6openalex-snapshot
Parallel Edge Coloring of a Tree on a Mesh Connected Computer
inferred← citeshttps://doi.org/10.1007/3-540-45477-2_4openalex-snapshot
Approximate Constrained Bipartite Edge Coloring
inferred← citeshttps://doi.org/10.1007/3-540-48086-2_10openalex-snapshot
Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time
inferred← citeshttps://doi.org/10.1007/3-540-48340-3_34openalex-snapshot
Edge Coloring of Bipartite Graphs with Constraints
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_182openalex-snapshot
Edge-coloring and f-coloring for various classes of graphs
inferred← citeshttps://doi.org/10.1007/3-540-61576-8_69openalex-snapshot
Enumeration algorithm for the edge coloring problem on bipartite graphs
inferred← citeshttps://doi.org/10.1007/3-540-61794-9_50openalex-snapshot
Computer-aided school and university timetabling: The new wave
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-1-4614-4630-9_8openalex-snapshot
A Petabit Bufferless Optical Switch for Data Center Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-57586-5_27openalex-snapshot
Space-Efficient Euler Partition and Bipartite Edge Coloring
inferred← citeshttps://doi.org/10.1007/978-3-540-39890-5_2openalex-snapshot
Matching, Edge-Colouring, and Dimers
inferred← citeshttps://doi.org/10.1007/978-3-540-73545-8_54openalex-snapshot
Approximation Algorithms for the Black and White Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-74450-4_32openalex-snapshot
On the Complexity of the Max-Edge-Coloring Problem with Its Variants
inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_55openalex-snapshot
Tight Approximation Bounds for Connectivity with a Color-Spanning Set
inferred← citeshttps://doi.org/10.1007/978-3-642-46955-8_78openalex-snapshot
Some results concerning the complexity of interval edge-colorings of graphs
inferred← citeshttps://doi.org/10.1007/bf01416610openalex-snapshot
A heuristic for decomposing traffic matrices in TDMA satellite communication
inferred← citeshttps://doi.org/10.1007/bf01680373openalex-snapshot
On unit time open shops with additional restrictions
inferred← citeshttps://doi.org/10.1007/bf02104831openalex-snapshot
Combinatorial analysis (nonnegative matrices, algorithmic problems)
inferred← citeshttps://doi.org/10.1007/bfb0002744openalex-snapshot
Routing on the PADAM: Degrees of optimality
inferred← citeshttps://doi.org/10.1007/bfb0040369openalex-snapshot
Fast parallel and sequential algorithms for edge-coloring planar graphs
inferred← citeshttps://doi.org/10.1007/bfb0054376openalex-snapshot
Solving fundamental problems on sparse-meshes
inferred← citeshttps://doi.org/10.1007/s00446-005-0149-0openalex-snapshot
Distributed scheduling for disconnected cooperation
inferred← citeshttps://doi.org/10.1007/s00493-015-2653-6openalex-snapshot
Perfect Matchings in Õ (n1.5) Time in Regular Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/s004930170002openalex-snapshot
Edge-Coloring Bipartite Multigraphs in O ( E log D ) Time
inferred← citeshttps://doi.org/10.1007/s10852-008-9090-0openalex-snapshot
Graph Optimization Approaches for Minimal Rerouting in Symmetric Three Stage Clos Networks
inferred← citeshttps://doi.org/10.1007/s10951-015-0424-2openalex-snapshot
A complexity analysis and an algorithmic approach to student sectioning in existing timetables
inferred← citeshttps://doi.org/10.1007/s11134-021-09726-7openalex-snapshot
An algorithm for improved delay-scaling in input-queued switches
inferred← citeshttps://doi.org/10.1007/s42979-023-01725-0openalex-snapshot
On the Complexity of Predicting Election Outcomes and Estimating Their Robustness
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90546-6openalex-snapshot
Interval edge coloring of a graph with forbidden colors
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00191-xopenalex-snapshot
A linear time algorithm for edge coloring of binomial trees
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90176-1openalex-snapshot
The complexity of scheduling independent two-processor tasks on dedicated processors
inferred← citeshttps://doi.org/10.1016/0022-0000(91)90022-wopenalex-snapshot
An implicit data structure for searching a multikey table in logarithmic time
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90202-lopenalex-snapshot
Some results concerning the complexity of restricted colorings of graphs
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90039-8openalex-snapshot
A better than “best possible” algorithm to edge color multigraphs
inferred← citeshttps://doi.org/10.1016/0196-6774(87)90026-5openalex-snapshot
Efficient parallel algorithms for edge coloring problems
inferred← citeshttps://doi.org/10.1016/0196-6774(89)90022-9openalex-snapshot
Fast algorithms for edge-coloring planar graphs
inferred← citeshttps://doi.org/10.1016/0196-6774(90)90032-aopenalex-snapshot
Improved edge-coloring algorithms for planar graphs
inferred← citeshttps://doi.org/10.1016/0743-7315(92)90018-iopenalex-snapshot
Scheduling parallel I/O operations in multiple bus systems
inferred← citeshttps://doi.org/10.1016/j.dam.2003.12.006openalex-snapshot
Approximate constrained bipartite edge coloring
inferred← citeshttps://doi.org/10.1016/j.dam.2005.02.003openalex-snapshot
A note on 3D orthogonal graph drawing
inferred← citeshttps://doi.org/10.1016/j.dam.2005.11.002openalex-snapshot
Latin squares with bounded size of row prefix intersections
inferred← citeshttps://doi.org/10.1016/j.dam.2023.01.029openalex-snapshot
A Markov chain on the solution space of edge colorings of bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.parco.2019.102566openalex-snapshot
Data staging for efficient high throughput stream processing
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.01.008openalex-snapshot
Space-efficient Euler partition and bipartite edge coloring
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113939openalex-snapshot
Arbitrary-size permutation networks using arbitrary-radix switches
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00167-3openalex-snapshot
Routing and path multicoloring
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00273-9openalex-snapshot
A simple matching algorithm for regular bipartite graphs
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00446-5openalex-snapshot
A simple algorithm for edge-coloring bipartite multigraphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00126-6openalex-snapshot
Open shop problem with zero-one time operations and integer release date/deadline intervals
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00189-4openalex-snapshot
Multicolor routing in the undirected hypercube
inferred← citeshttps://doi.org/10.1016/s0167-6377(97)00015-1openalex-snapshot
Minimizing the total completion time in a unit-time open shop with release times
inferred← citeshttps://doi.org/10.1016/s0167-8191(00)00030-2openalex-snapshot
Scheduling balanced task-graphs to LogP-machines
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00400-xopenalex-snapshot
Edge coloring of bipartite graphs with constraints
inferred← citeshttps://doi.org/10.1016/s0743-7315(03)00115-1openalex-snapshot
Fast parallel edge colouring of graphs
inferred← citeshttps://doi.org/10.1080/02522667.1996.10699304openalex-snapshot
Distributed algorithms for maximum cliques
inferred← citeshttps://doi.org/10.1093/ietcom/e89-b.1.19openalex-snapshot
A Class of Benes-Based Optical Multistage Interconnection Networks for Crosstalk-Free Realization of Permutations
inferred← citeshttps://doi.org/10.1109/12.102836openalex-snapshot
An efficient routing algorithm for realizing linear permutations on p/sup t/-shuffle-exchange networks
inferred← citeshttps://doi.org/10.1109/18.272499openalex-snapshot
The complexity of routing in Clos permutation networks
inferred← citeshttps://doi.org/10.1109/43.594837openalex-snapshot
Net assignment for the FPGA-based logic emulation system in the folded-Clos network structure
inferred← citeshttps://doi.org/10.1109/90.556359openalex-snapshot
Efficient scheduling of transmissions in optical broadcast networks
inferred← citeshttps://doi.org/10.1109/apcc.2003.1274248openalex-snapshot
A new multiple-multicast algorithm in a class of self-routable switching network
inferred← citeshttps://doi.org/10.1109/cicc.1988.20866openalex-snapshot
SPAID: an architectural synthesis tool for DSP custom applications
inferred← citeshttps://doi.org/10.1109/cw.2002.1180887openalex-snapshot
Vertically stacked Benes networks for crosstalk-free permutation
inferred← citeshttps://doi.org/10.1109/etfa.1999.815375openalex-snapshot
Chromatic scheduling of dedicated 2-processor UET tasks to minimize mean flow time
inferred← citeshttps://doi.org/10.1109/glocom.2004.1378281openalex-snapshot
Minimizing internal speedup for performance guaranteed optical packet switches
inferred← citeshttps://doi.org/10.1109/glocom.2005.1577998openalex-snapshot
Two-layer parallel switching: a practical and survivable design for performance guaranteed optical packet switches
inferred← citeshttps://doi.org/10.1109/glocom.2006.350openalex-snapshot
NXG06-4: Improving Scheduling Efficiency for High-Speed Routers with Optical Switch Fabrics
inferred← citeshttps://doi.org/10.1109/hpsr.2005.1503226openalex-snapshot
On optimization of optical packet switches with reconfiguration overhead
inferred← citeshttps://doi.org/10.1109/hpsr.2006.1709703openalex-snapshot
Can we schedule traffic more efficiently in optical packet switches?
inferred← citeshttps://doi.org/10.1109/icc.2003.1204591openalex-snapshot
λ-ADJUST scheduling algorithm for optical switches with reconfiguration delay
inferred← citeshttps://doi.org/10.1109/icc.2005.1494657openalex-snapshot
Scheduling optical packet switches with minimum number of configurations
inferred← citeshttps://doi.org/10.1109/icecs.2010.5724550openalex-snapshot
Design of parallel LDPC interleaver architecture: A bipartite edge coloring approach
inferred← citeshttps://doi.org/10.1109/infcom.2002.1019276openalex-snapshot
Guaranteed scheduling for switches with configuration overhead
inferred← citeshttps://doi.org/10.1109/infcom.2004.1357019openalex-snapshot
On the benefit of tunability in reducing electronic port counts in WDM/TDM networks
inferred← citeshttps://doi.org/10.1109/infcom.2004.1357020openalex-snapshot
Nonblocking WDM switches based on arrayed waveguide grating and limited wavelength conversion
inferred← citeshttps://doi.org/10.1109/ipdps.2014.92openalex-snapshot
Collaborative Network Configuration in Hybrid Electrical/Optical Data Center Networks
inferred← citeshttps://doi.org/10.1109/iscas.2011.5937914openalex-snapshot
An approach based on edge coloring of tripartite graph for designing parallel LDPC interleaver architecture
inferred← citeshttps://doi.org/10.1109/jlt.2008.2005552openalex-snapshot
Minimum Delay Scheduling for Performance Guaranteed Switches With Optical Fabrics
inferred← citeshttps://doi.org/10.1109/jsac.2003.815843openalex-snapshot
On scheduling optical packet switches with reconfiguration delay
inferred← citeshttps://doi.org/10.1109/jsac.2005.852240openalex-snapshot
Optimal transceiver scheduling in WDM/TDM networks
inferred← citeshttps://doi.org/10.1109/mpcs.1994.367023openalex-snapshot
Avoiding memory contention on tightly coupled multiprocessors
inferred← citeshttps://doi.org/10.1109/mppoi.1997.609080openalex-snapshot
On wavelength assignment in WDM optical networks
inferred← citeshttps://doi.org/10.1109/mppoi.1998.682142openalex-snapshot
Scheduling file transfers in WDM optical networks
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63502openalex-snapshot
Interior-point methods in parallel computation
inferred← citeshttps://doi.org/10.1109/tc.2004.1268399openalex-snapshot
A fault-tolerant rearrangeable permutation network
inferred← citeshttps://doi.org/10.1109/tcom.1983.1095923openalex-snapshot
Control Algorithms for Rearrangeable Clos Networks
inferred← citeshttps://doi.org/10.1109/tnet.2003.818190openalex-snapshot
Guaranteed scheduling for switches with configuration overhead
inferred← citeshttps://doi.org/10.1109/tnet.2005.863459openalex-snapshot
Constructions and analyses of nonblocking WDM switches based on arrayed waveguide grating and limited wavelength conversion
inferred← citeshttps://doi.org/10.1109/tnet.2008.926501openalex-snapshot
Minimizing Internal Speedup for Performance Guaranteed Switches With Optical Fabrics
inferred← citeshttps://doi.org/10.1109/tnsm.2017.2761321openalex-snapshot
Flow Optimization in Data Centers With Clos Networks in Support of Cloud Applications
inferred← citeshttps://doi.org/10.1109/tpds.2005.95openalex-snapshot
Parallel routing algorithms for nonblocking electronic and photonic switching networks
inferred← citeshttps://doi.org/10.1109/tqe.2022.3180900openalex-snapshot
Depth Optimization of CZ, CNOT, and Clifford Circuits
inferred← citeshttps://doi.org/10.1137/1.9781611973068.2openalex-snapshot
Perfect Matchings via Uniform Sampling in Regular Bipartite Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611975031.62openalex-snapshot
Randomized Online Matching in Regular Graphs
inferred← citeshttps://doi.org/10.1137/100812513openalex-snapshot
Perfect Matchings in $O(n\log n)$ Time in Regular Bipartite Graphs
inferred← citeshttps://doi.org/10.1137/s0097539702408235openalex-snapshot
Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs
inferred← citeshttps://doi.org/10.1137/s0097539704442714openalex-snapshot
WDM Switching Networks, Rearrangeable and Nonblocking [w,f]-connectors
inferred← citeshttps://doi.org/10.1137/s0097539796299266openalex-snapshot
Bipartite Edge Coloring in $O(\Delta m)$ Time
inferred← citeshttps://doi.org/10.1137/s0895480199351136openalex-snapshot
Finding 1-Factors in Bipartite Regular Graphs and Edge-Coloring Bipartite Graphs
inferred← citeshttps://doi.org/10.1145/115234.115347openalex-snapshot
Simulating (log c n )-wise independence in NC
inferred← citeshttps://doi.org/10.1145/123465.123488openalex-snapshot
Implementation optimization techniques for architecture synthesis of application-specific processors
inferred← citeshttps://doi.org/10.1145/1721837.1721843openalex-snapshot
Perfect matchings via uniform sampling in regular bipartite graphs
inferred← citeshttps://doi.org/10.1145/1806689.1806697openalex-snapshot
Perfect matchings in o( n log n ) time in regular bipartite graphs
inferred← citeshttps://doi.org/10.1145/2966986.2967004openalex-snapshot
Arbitrary streaming permutations with minimum memory and latency
inferred← citeshttps://doi.org/10.1145/341800.341820openalex-snapshot
An experimental study of a simple, distributed edge coloring algorithm
inferred← citeshttps://doi.org/10.1145/347792.347808openalex-snapshot
Efficient implementation of an optimal greedy algorithm for wavelength assignment in directed tree networks
inferred← citeshttps://doi.org/10.1145/3717823.3718265openalex-snapshot
Vizing’s Theorem in Near-Linear Time
inferred← citeshttps://doi.org/10.1145/62212.62245openalex-snapshot
Storing and searching a multikey table
inferred← citeshttps://doi.org/10.1145/6462.6502openalex-snapshot
Efficient algorithms for finding maximum matching in graphs
inferred← citeshttps://doi.org/10.1145/800221.806726openalex-snapshot
Scheduling file transfers in a distributed network
inferred← citeshttps://doi.org/10.1201/9781420011296.ch36openalex-snapshot
Message Dissemination Using Modern Communication Primitives
inferred← citeshttps://doi.org/10.1364/jocn.474187openalex-snapshot
On the network design and control of an optical network: interconnecting multiple chips on a wafer
inferred← citeshttps://doi.org/10.1541/ieejeiss1987.114.4_444openalex-snapshot
Finding All the Edge Colorings in Bipartite Graphs
inferred← citeshttps://doi.org/10.1587/transfun.e99.a.1813openalex-snapshot
On the Three-Dimensional Channel Routing
inferred← citeshttps://doi.org/10.1609/aaai.v36i4.20290openalex-snapshot
Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study
inferred← citeshttps://doi.org/10.17148/ijarcce.2014.31137openalex-snapshot
Query Suggestion and Recommendation Using Bipartite Graph and K-Means Clustering
inferred← citeshttps://doi.org/10.20381/ruor-13096openalex-snapshot
Frame-based bandwidth allocation for Agile All-Photonic Networks
inferred← citeshttps://doi.org/10.3233/hsn-1999-173openalex-snapshot
On bounds for the wavelength assignment problem on optical ring networks
inferred← citeshttps://doi.org/10.4230/lipics.swat.2020.26openalex-snapshot
Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.0902.1617openalex-snapshot
Perfect Matchings in Õ(n^{1.5}) Time in Regular Bipartite Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1107.2482openalex-snapshot
Maximum Matchings via Glauber Dynamics
inferred← citeshttps://doi.org/10.5555/338219.338613openalex-snapshot
Strictly non-blocking WDM cross-connects
inferred← citeshttps://doi.org/10.5555/644108.644248openalex-snapshot
Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs
inferred← citeshttps://doi.org/10.7155/jgaa.00012openalex-snapshot
Edge-Coloring and f-Coloring for Various Classes 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.