On the public citation graph
Domain clustering for inter‐domain path computation speed‐up
0 signed · 37 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/s00373-012-1243-2openalex-snapshot
Rainbow Connections of Graphs: A Survey
inferredcites →https://doi.org/10.1109/12.144623openalex-snapshot
A fast distributed shortest path algorithm for a class of hierarchically clustered data networks
inferredcites →https://doi.org/10.1109/71.722218openalex-snapshot
A new parallel and distributed shortest path algorithm for hierarchically clustered data networks
inferredcites →https://doi.org/10.1109/icc.2010.5502390openalex-snapshot
Hierarchical Border Gateway Protocol (HBGP) for PCE-Based Multi-Domain Traffic Engineering
inferredcites →https://doi.org/10.1109/icton.2011.5970767openalex-snapshot
Scalable hybrid path computation procedure for PCE-based multi-domain WSON Networks
inferredcites →https://doi.org/10.1109/jproc.2014.2371999openalex-snapshot
Software-Defined Networking: A Comprehensive Survey
inferredcites →https://doi.org/10.1109/mascot.2009.5366808openalex-snapshot
Finding a simple path with multiple must-include nodes
inferredcites →https://doi.org/10.1109/nca.2011.11openalex-snapshot
Treewidth and Hyperbolicity of the Internet
inferredcites →https://doi.org/10.1109/surv.2013.011413.00087openalex-snapshot
A Survey on the Path Computation Element (PCE) Architecture
inferredcites →https://doi.org/10.1109/tnet.2009.2022369openalex-snapshot
Weighted Spectral Distribution for Internet Topology Analysis: Theory and Applications
inferredcites →https://doi.org/10.1145/144179.144203openalex-snapshot
Scalable inter-domain routing architecture
inferredcites →https://doi.org/10.1145/144191.144203openalex-snapshot
Scalable inter-domain routing architecture
inferredcites →https://doi.org/10.1145/3027947.3027948openalex-snapshot
Recursive SDN for Carrier Networks
inferredcites →https://doi.org/10.1364/jocn.4.000876openalex-snapshot
Domain Sequence Protocol (DSP) for PCE-Based Multi-Domain Traffic Engineering
inferredcites →https://doi.org/10.17487/rfc4726openalex-snapshot
A Framework for Inter-Domain Multiprotocol Label Switching Traffic Engineering
inferredcites →https://doi.org/10.17487/rfc5439openalex-snapshot
An Analysis of Scaling Issues in MPLS-TE Core Networks
inferredcites →https://doi.org/10.17487/rfc5441openalex-snapshot
A Backward-Recursive PCE-Based Computation (BRPC) Procedure to Compute Shortest Constrained Inter-Domain Traffic Engineering Label Switched Paths
inferredcites →https://doi.org/10.17487/rfc6805openalex-snapshot
The Application of the Path Computation Element Architecture to the Determination of a Sequence of Domains in MPLS and GMPLS
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-981-96-4288-5_19openalex-snapshot
A Hybrid Multifactorial Evolutionary Algorithm for the Minimum s-Club Cover Problem
inferred← citeshttps://doi.org/10.1007/s12065-024-00999-4openalex-snapshot
Evolutionary multitasking algorithm based on a dynamic solution encoding strategy for the minimum s-club cover problem
inferred← citeshttps://doi.org/10.1007/s13369-024-08761-9openalex-snapshot
A Multi-start Variable Neighbourhood Search with a New Solution Construction Method for Solving Inter-Domain Path Computation Problem
inferred← citeshttps://doi.org/10.1016/j.asoc.2023.110063openalex-snapshot
A Particle Swarm Optimization and Variable Neighborhood Search Based Multipopulation Algorithm for Inter-Domain Path Computation Problem
inferred← citeshttps://doi.org/10.1016/j.knosys.2023.111168openalex-snapshot
Node-depth based Genetic Algorithm to solve Inter-Domain path computation problem
inferred← citeshttps://doi.org/10.1016/j.knosys.2025.114910openalex-snapshot
MultiFatorial evolutionary algorithm with nodedepth encoding for inter-domain path computation under node-defined domain uniqueness constraint
inferred← citeshttps://doi.org/10.1016/j.swevo.2024.101501openalex-snapshot
A multi-population multi-tasking variable neighborhood search algorithm with diversity enhancements for inter-domain path computation problem
inferred← citeshttps://doi.org/10.1109/cec45853.2021.9504728openalex-snapshot
A Two-level Genetic Algorithm for Inter-domain Path Computation under Node-defined Domain Uniqueness Constraints
inferred← citeshttps://doi.org/10.1109/cec48606.2020.9185701openalex-snapshot
Multifactorial Evolutionary Algorithm for Inter-Domain Path Computation under Domain Uniqueness Constraint
inferred← citeshttps://doi.org/10.1109/cec55065.2022.9870339openalex-snapshot
A Genetic Ant Colony Optimization Algorithm for Inter-domain Path Computation problem under the Domain Uniqueness constraint
inferred← citeshttps://doi.org/10.1109/icccn49398.2020.9209665openalex-snapshot
Joint Optimization Of Routing and Flexible Ethernet Assignment In Multi-layer Multi-domain Networks
inferred← citeshttps://doi.org/10.1109/iscc50000.2020.9219553openalex-snapshot
Hierarchical Path Computation With Flexible Ethernet In Multi-layer Multi-domain Networks
inferred← citeshttps://doi.org/10.1109/jlt.2020.3044845openalex-snapshot
Efficient Routing Using Flexible Ethernet in Multi-Layer Multi-Domain Networks
inferred← citeshttps://doi.org/10.1109/ukrmico43733.2018.9047573openalex-snapshot
Diakoptical Method of Inter-Area Routing in the Telecommunication Network
inferred← citeshttps://doi.org/10.1145/3628797.3628972openalex-snapshot
A Monte Carlo Tree Search with Ant Colony Optimization for Inter-domain Path Computation Problem
inferred← citeshttps://doi.org/10.31577/cai_2023_1_98openalex-snapshot
Adaptive Evolutionary Multitasking to Solve Inter-Domain Path Computation Under Node-Defined Domain Uniqueness Constraint: New Solution Encoding Scheme
inferred← citeshttps://doi.org/10.34238/tnu-jst.5579openalex-snapshot
THUẬT TOÁN TIẾN HÓA ĐA NHÂN TỐ THÍCH NGHI GIẢI BÀI TOÁN TÌM ĐƯỜNG ĐI LIÊN MIỀN VỚI RÀNG BUỘC MIỀN DUY NHẤT TRÊN NÚT MẠNG
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.