On the public citation graph

Strong Edge Coloring for Channel Assignment in Wireless Radio Networks

0 signed · 83 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/pl00009196openalex-snapshot
On Coloring Unit Disk Graphs
inferredcites →https://doi.org/10.1016/j.dam.2004.03.001openalex-snapshot
A polynomial time algorithm for strong edge coloring of partial k-trees
inferredcites →https://doi.org/10.1016/s0166-218x(01)00237-2openalex-snapshot
On the computational complexity of strong edge coloring
inferredcites →https://doi.org/10.1023/a:1012311216333openalex-snapshot
Models and Approximation Algorithms for Channel Assignment in Radio Networks
inferredcites →https://doi.org/10.1109/18.825799openalex-snapshot
The capacity of wireless networks
inferredcites →https://doi.org/10.1109/90.222924openalex-snapshot
Scheduling algorithms for multihop radio networks
inferredcites →https://doi.org/10.1109/infcom.1997.644573openalex-snapshot
A unified framework and algorithm for (T/F/C)DMA channel assignment in wireless networks
inferredcites →https://doi.org/10.1109/jsac.2004.830909openalex-snapshot
The Distance-2 Matching Problem and Its Relationship to the MAC-Layer Capacity of Ad Hoc Wireless Networks
inferredcites →https://doi.org/10.1137/0215074openalex-snapshot
A Simple Parallel Algorithm for the Maximal Independent Set Problem
inferredcites →https://doi.org/10.1137/0607016openalex-snapshot
Efficient Vertex- and Edge-Coloring of Outerplanar Graphs
inferredcites →https://doi.org/10.1145/144179.144283openalex-snapshot
Scheduling algorithms for multi-hop radio networks
inferredcites →https://doi.org/10.1145/190314.190334openalex-snapshot
MACAW
inferredcites →https://doi.org/10.1145/190809.190334openalex-snapshot
MACAW
inferredcites →https://doi.org/10.1145/288235.288244openalex-snapshot
Balanced media access methods for wireless networks
inferredcites →https://doi.org/10.1145/345910.345925openalex-snapshot
Achieving MAC layer fairness in wireless packet networks
inferredcites →https://doi.org/10.1145/381677.381700openalex-snapshot
A rate-adaptive MAC protocol for multi-Hop wireless networks
inferredcites →https://doi.org/10.48550/arxiv.cs/0509100openalex-snapshot
Distance-2 Edge Coloring is NP-Complete

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.21491openalex-snapshot
Distance edge coloring and collision‐free communication in wireless sensor networks
inferred← citeshttps://doi.org/10.1007/978-3-030-34405-4_8openalex-snapshot
Multi-channel Assignment and Link Scheduling for Prioritized Latency-Sensitive Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-39479-0_11openalex-snapshot
Approximate Strong Edge-Colouring of Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-13803-9_5openalex-snapshot
On-Demand Spectrum Access
inferred← citeshttps://doi.org/10.1007/978-3-319-19662-6_3openalex-snapshot
Scheduling Connections via Path and Edge Multicoloring
inferred← citeshttps://doi.org/10.1007/978-3-540-72951-8_16openalex-snapshot
Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-11322-2_18openalex-snapshot
Radio Network Distributed Algorithms in the Unknown Neighborhood Model
inferred← citeshttps://doi.org/10.1007/978-3-642-11409-0_18openalex-snapshot
Local Algorithms for Edge Colorings in UDGs
inferred← citeshttps://doi.org/10.1007/978-3-642-27951-5_8openalex-snapshot
Research of the Distributed Time-Slot Assignment of WSN for Meter Reading System
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_36openalex-snapshot
Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation
inferred← citeshttps://doi.org/10.1007/978-88-7642-475-5_43openalex-snapshot
Strong chromatic index of planar graphs with large girth
inferred← citeshttps://doi.org/10.1007/978-90-481-9794-1_36openalex-snapshot
A Heuristic for Fast Convergence in Interference-free Channel Assignment Using D1EC Coloring
inferred← citeshttps://doi.org/10.1007/978-981-16-1941-0_65openalex-snapshot
An Adaptive Channel Assignment Strategy for Multi-radio Multi-channel Wireless Mesh Networks with Mobile Nodes Based on Internet Traffic
inferred← citeshttps://doi.org/10.1007/s00373-021-02379-6openalex-snapshot
Strong Cliques in Claw-Free Graphs
inferred← citeshttps://doi.org/10.1007/s10878-015-9972-9openalex-snapshot
Maximum cardinality neighbourly sets in quadrilateral free graphs
inferred← citeshttps://doi.org/10.1007/s10878-015-9983-6openalex-snapshot
On (s, t)-relaxed strong edge-coloring of graphs
inferred← citeshttps://doi.org/10.1007/s11067-024-09661-zopenalex-snapshot
A Backtracking Algorithm for Solving the Nearly Equitable Strong Edge-coloring Problem on Transportation Network
inferred← citeshttps://doi.org/10.1007/s11227-017-2146-zopenalex-snapshot
Cross-layer design and performance analysis for maximizing the network utilization of wireless mesh networks in cloud computing
inferred← citeshttps://doi.org/10.1007/s11277-019-06305-1openalex-snapshot
Adaptive Resource Allocation for WiMAX Mesh Network
inferred← citeshttps://doi.org/10.1007/s40009-020-00977-1openalex-snapshot
Strong Chromatic Index of Generalized Polygon Snake Graphs
inferred← citeshttps://doi.org/10.1016/j.adhoc.2011.04.011openalex-snapshot
On channel-discontinuity-constraint routing in wireless networks
inferred← citeshttps://doi.org/10.1016/j.amc.2017.11.057openalex-snapshot
Odd graph and its applications to the strong edge coloring
inferred← citeshttps://doi.org/10.1016/j.comcom.2012.02.008openalex-snapshot
Novel 2-hop coloring algorithm for time-slot assignment of newly deployed sensor nodes without ID in wireless sensor and robot networks
inferred← citeshttps://doi.org/10.1016/j.comcom.2012.05.013openalex-snapshot
Scheduling and channel assignment algorithm for IEEE 802.16 mesh networks using clique partitioning technique
inferred← citeshttps://doi.org/10.1016/j.dam.2011.06.015openalex-snapshot
Strong edge colouring of subcubic graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2013.05.021openalex-snapshot
On strong edge-colouring of subcubic graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2015.06.025openalex-snapshot
On the complexity of the flow coloring problem
inferred← citeshttps://doi.org/10.1016/j.dam.2020.03.024openalex-snapshot
Strong chromatic index of K1,t -free graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2016.01.003openalex-snapshot
Clique number of the square of a line graph
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.06.001openalex-snapshot
Strong edge-colorings of sparse graphs with large maximum degree
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.11.008openalex-snapshot
Local edge colouring of Yao-like subgraphs of Unit Disk Graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.05.005openalex-snapshot
Local algorithms for edge colorings in UDGs
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.05.026openalex-snapshot
Incidence coloring of Mycielskians with fast algorithm
inferred← citeshttps://doi.org/10.1109/access.2016.2622720openalex-snapshot
Distributed Degree-Based Link Scheduling for Collision Avoidance in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/broadnets.2008.4769106openalex-snapshot
Joint routing and channel assignment in multi-channel wireless infrastructure networks
inferred← citeshttps://doi.org/10.1109/euc.2010.71openalex-snapshot
A Fast Heuristic for Solving the D1EC Coloring Problem
inferred← citeshttps://doi.org/10.1109/icacci.2018.8554649openalex-snapshot
Minimum Interference Topology Control in Cognitive Radio Networks through Channel Assignment
inferred← citeshttps://doi.org/10.1109/icccn.2009.5235215openalex-snapshot
A Comparison of Channel Assignment Techniques with Power Control in Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/icectech.2011.5942065openalex-snapshot
A domain specific heuristic algorithm for broadcast scheduling problem in wireless multihop networks
inferred← citeshttps://doi.org/10.1109/icumt.2009.5345595openalex-snapshot
QoS aware distributed matching algorithm for link scheduling in wireless networks
inferred← citeshttps://doi.org/10.1109/infcom.2010.5462188openalex-snapshot
On Channel-Discontinuity-Constraint Routing in Wireless Networks
inferred← citeshttps://doi.org/10.1109/ipdpsw.2012.103openalex-snapshot
Distributed Algorithms for TDMA Link Scheduling in Sensor Networks
inferred← citeshttps://doi.org/10.1109/ipdpsw.2012.217openalex-snapshot
Two Edge Coloring Algorithms Using a Simple Matching Discovery Automata
inferred← citeshttps://doi.org/10.1109/lanman.2008.4675850openalex-snapshot
Analyzing channel assignment with rearrangement in multi-channel wireless line networks
inferred← citeshttps://doi.org/10.1109/ncc.2015.7084847openalex-snapshot
Joint channel allocation and routing in wireless mesh networks
inferred← citeshttps://doi.org/10.1109/qr2mse.2013.6625537openalex-snapshot
Notice of Retraction Invulnerability of colored networks: A survey
inferred← citeshttps://doi.org/10.1109/tcomm.2009.03.070082openalex-snapshot
A sequential approach for optimal broadcast scheduling in packet radio networks
inferred← citeshttps://doi.org/10.1109/tcomm.2010.11.090301openalex-snapshot
A Probabilistic Greedy Algorithm for Channel Assignment in Cellular Radio Networks
inferred← citeshttps://doi.org/10.1109/tit.2018.2806486openalex-snapshot
A Conditional Information Inequality and Its Combinatorial Applications
inferred← citeshttps://doi.org/10.1109/wcnc.2010.5506275openalex-snapshot
A Distributed Collision-Free Low-Latency Link Scheduling Scheme in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/wowmom.2013.6583479openalex-snapshot
i-POCA: Interference-aware partially overlapping channel assignment in 802.11-based meshes
inferred← citeshttps://doi.org/10.1142/s1793830923500738openalex-snapshot
Strong chromatic indices of certain binary operations on graphs
inferred← citeshttps://doi.org/10.1145/1989493.1989520openalex-snapshot
Approximation algorithms for secondary spectrum auctions
inferred← citeshttps://doi.org/10.1145/2663496openalex-snapshot
Approximation Algorithms for Secondary Spectrum Auctions
inferred← citeshttps://doi.org/10.1155/2022/9320700openalex-snapshot
Chromatic Polynomial of Intuitionistic Fuzzy Graphs Using α , β -Levels
inferred← citeshttps://doi.org/10.1287/ijoc.1070.0252openalex-snapshot
Optimal Broadcast Scheduling in Packet Radio Networks via Branch and Price
inferred← citeshttps://doi.org/10.15803/ijnc.3.1_55openalex-snapshot
Distributed Algorithms for TDMA Link Scheduling in Sensor Networks
inferred← citeshttps://doi.org/10.1587/transinf.2014edp7184openalex-snapshot
Dominating Sets and Induced Matchings in Orthogonal Ray Graphs
inferred← citeshttps://doi.org/10.3390/fi2030308openalex-snapshot
Energy Efficient Routing and Node Activity Scheduling in the OCARI Wireless Sensor Network
inferred← citeshttps://doi.org/10.3390/sym15071301openalex-snapshot
An Analysis of the Factors Influencing the Strong Chromatic Index of Graphs Derived by Inflating a Few Common Classes of Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.0912.4115openalex-snapshot
On Channel-Discontinuity-Constraint Routing in Wireless Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1501.04867openalex-snapshot
Conditional Information Inequalities and Combinatorial Applications
inferred← citeshttps://doi.org/10.5121/ijwmn.2011.3507openalex-snapshot
Channel Assignment Algorithms for MRMC Wireless Mesh Networks
inferred← citeshttps://doi.org/10.5772/2612openalex-snapshot
Wireless Mesh Networks - Efficient Link Scheduling, Channel Assignment and Network Planning Strategies
inferred← citeshttps://doi.org/10.5772/48476openalex-snapshot
Partially Overlapping Channel Assignments in Wireless Mesh Networks
inferred← citeshttps://doi.org/10.7151/dmgt.1763openalex-snapshot
Strong chromatic index of planar graphs with large girth
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.