On the public citation graph
On finding the simple paths and circuits in a graph
0 signed · 63 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.1049/piee.1967.0009openalex-snapshot
Pathfinding through a communication network
inferredcites →https://doi.org/10.1109/tct.1966.1082574openalex-snapshot
Computer Recognition and Extraction of Planar Graphs from the Incidence Matrix
inferredcites →https://doi.org/10.1109/tct.1967.1082662openalex-snapshot
Generation of all Hamiltonian Circuits, Paths, and Centers of a Graph, and Related Problems
inferredcites →https://doi.org/10.1137/0114051openalex-snapshot
Self-Avoiding Paths and the Adjacency Matrix of a Graph
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.2162037openalex-extracted
Understanding the Impacts of Indirect Stakeholder Relationships Stakeholder Value Network Analysis and Its Application to Large Engineering Projects
inferred← citeshttps://doi.org/10.2139/ssrn.2832637openalex-extracted
Designing an Institutional Investor's Collaborative Network: A Case Study of Value Network Analysis
inferred← citeshttps://doi.org/10.2139/ssrn.4772530openalex-extracted
Integrating Stakeholder Value Network with Strategic Issue Management for Multi-Stakeholder's Requirement Analysis of Vertical Farming Systems
inferred← citeshttps://doi.org/10.1002/9781119245636.ch5openalex-snapshot
Distribution Network Representation in the Presence of Demand Response
inferred← citeshttps://doi.org/10.1002/net.1975.5.2.151openalex-snapshot
A Vertex Elimination Algorithm for Enumerating all Simple Paths in a Graph
inferred← citeshttps://doi.org/10.1002/net.3230170305openalex-snapshot
Digraphs with maximum number of paths and cycles
inferred← citeshttps://doi.org/10.1002/qre.1772openalex-snapshot
Enumeration of Minimal Cutsets for Directed Networks with Comparative Reliability Study for Paths or Cuts
inferred← citeshttps://doi.org/10.1007/978-3-031-55598-5_3openalex-snapshot
Enumerating m-Length Walks in Directed Graphs with Constant Delay
inferred← citeshttps://doi.org/10.1007/978-3-319-16133-4openalex-snapshot
Transport of Water versus Transport over Water
inferred← citeshttps://doi.org/10.1007/978-3-319-16133-4_7openalex-snapshot
Coordinating Model Predictive Control of Transport and Supply Water Systems
inferred← citeshttps://doi.org/10.1007/s13198-023-01927-yopenalex-snapshot
An efficient sum of disjoint product method for reliability evaluation of stochastic flow networks using d-MPs
inferred← citeshttps://doi.org/10.1016/0012-365x(79)90131-6openalex-snapshot
Generalized fibonacci maximum path graphs
inferred← citeshttps://doi.org/10.1016/0026-2714(80)90584-3openalex-snapshot
Enumeration of all simple paths in a communication network
inferred← citeshttps://doi.org/10.1016/0026-2714(84)90460-8openalex-snapshot
A Petri net approach to enumerating all circuits of a graph
inferred← citeshttps://doi.org/10.1016/0026-2714(87)90174-0openalex-snapshot
Determination of all hamiltonian paths and circuits and the minimal feedback set in a graph through Petri nets
inferred← citeshttps://doi.org/10.1016/0026-2714(87)90459-8openalex-snapshot
An efficient method for terminal and multiterminal pathset enumeration
inferred← citeshttps://doi.org/10.1016/0026-2714(93)90314-oopenalex-snapshot
Enumeration of pathsets of reliability graphs by repeated indexing
inferred← citeshttps://doi.org/10.1016/j.agsy.2024.104133openalex-snapshot
Integrating stakeholder value network with strategic issue management for multi-stakeholder needs and requirements analysis of vertical farming systems
inferred← citeshttps://doi.org/10.1016/j.autcon.2021.104002openalex-snapshot
Streamlined project time-cost tradeoff optimization methodology: Algorithm, automation, and application
inferred← citeshttps://doi.org/10.1016/j.cie.2013.09.019openalex-snapshot
A graph theory-based approach to route location in railway interlocking
inferred← citeshttps://doi.org/10.1016/j.comnet.2016.04.022openalex-snapshot
HEER – A delay-aware and energy-efficient routing protocol for wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.jclepro.2017.01.136openalex-snapshot
Stakeholder power in industrial symbioses: A stakeholder value network approach
inferred← citeshttps://doi.org/10.1021/ci00063a007openalex-snapshot
Review of ring perception algorithms for chemical graphs
inferred← citeshttps://doi.org/10.1021/ci020373eopenalex-snapshot
Cyclical Conjunction: An Efficient Operator for the Extraction of Cycles from a Graph
inferred← citeshttps://doi.org/10.1029/2009wr007826openalex-snapshot
A flow path model for regional water distribution optimization
inferred← citeshttps://doi.org/10.1080/00207179.2016.1147606openalex-snapshot
Delay-robustness in distributed control of timed discrete-event systems based on supervisor localisation
inferred← citeshttps://doi.org/10.1098/rspa.2025.0696openalex-snapshot
Folding a tessellated uniform-thick plate into compact stacks
inferred← citeshttps://doi.org/10.1109/energycon.2012.6348229openalex-snapshot
Smart modeling and tools for Distribution System Management and operation
inferred← citeshttps://doi.org/10.1109/icdar.2009.228openalex-snapshot
Finding the Most Probable Ranking of Objects with Probabilistic Pairwise Preferences
inferred← citeshttps://doi.org/10.1109/iciinfs.2008.4798492openalex-snapshot
Minimal Cutset Enumeration in Directed Networks and Reliability Measures
inferred← citeshttps://doi.org/10.1109/icinfa.2015.7279596openalex-snapshot
A new algebraic approach to finding all simple paths and cycles in undirected graphs
inferred← citeshttps://doi.org/10.1109/icra55743.2025.11128099openalex-snapshot
Integrating Multi-Robot Adaptive Sampling and Informative Path Planning for Spatiotemporal Natural Environment Prediction
inferred← citeshttps://doi.org/10.1109/isemc.2015.7256270openalex-snapshot
Statistical properties of low frequency voltages induced by a plane-wave field across the terminal loads of a random wire-bundle
inferred← citeshttps://doi.org/10.1109/istt.2016.7918095openalex-snapshot
New mathematical model to find the shortest path based on Boolean algebra operations for networks
inferred← citeshttps://doi.org/10.1109/memc.0.8093845openalex-snapshot
Modeling field-to-wire coupling in random bundles of wires
inferred← citeshttps://doi.org/10.1109/proc.1969.7032openalex-snapshot
Enumeration of all circuits of a graph
inferred← citeshttps://doi.org/10.1109/rtsi.2015.7325109openalex-snapshot
Load Area application to radial distribution systems
inferred← citeshttps://doi.org/10.1109/ssp.2016.7551779openalex-snapshot
A Hawkes' eye view of network information flow
inferred← citeshttps://doi.org/10.1109/tcs.1978.1084515openalex-snapshot
Enumerating all simple paths in a graph
inferred← citeshttps://doi.org/10.1109/tct.1973.1083657openalex-snapshot
A Boolean algebra method for computing the terminal reliability in a communication network
inferred← citeshttps://doi.org/10.1109/temc.2015.2414356openalex-snapshot
Field-to-Wire Coupling Model for the Common Mode in Random Bundles of Twisted-Wire Pairs
inferred← citeshttps://doi.org/10.1112/jlms/s2-18.2.193openalex-snapshot
An Algorithm which Generates the Hamiltonian Circuits of a Cubic Planar Map
inferred← citeshttps://doi.org/10.1137/0205007openalex-snapshot
On Algorithms for Enumerating All Circuits of a Graph
inferred← citeshttps://doi.org/10.1142/s0218539300000043openalex-snapshot
AN ENUMERATION METHOD FOR THE MINIMAL PATHS OF NETWORK SYSTEMS
inferred← citeshttps://doi.org/10.1142/s0218539302000809openalex-snapshot
AN EFFICIENT MULTI-VARIABLE INVERSION ALGORITHM FOR RELIABILITY EVALUATION OF COMPLEX SYSTEMS USING PATH SETS
inferred← citeshttps://doi.org/10.1145/321850.321854openalex-snapshot
A Search Procedure for Hamilton Paths and Circuits
inferred← citeshttps://doi.org/10.1145/3490148.3538585openalex-snapshot
Scalable Fine-Grained Parallel Cycle Enumeration Algorithms
inferred← citeshttps://doi.org/10.1145/3611642openalex-snapshot
Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-constrained Cycles
inferred← citeshttps://doi.org/10.1145/3756423.3756505openalex-snapshot
Compact Foldable Panels with Hole in the Middle
inferred← citeshttps://doi.org/10.1155/2022/5453363openalex-snapshot
Simple Paths and Cycles of Directed Graph for Stock Trading Network Based on STP
inferred← citeshttps://doi.org/10.15587/2312-8372.2014.21250openalex-snapshot
An approach of developing a system of solid waste treatment
inferred← citeshttps://doi.org/10.1587/transcom.e98.b.1204openalex-snapshot
Combined MTL-Fullwave Statistical Approach for Fast Estimation of Radiated Immunity of Spacecraft Cable Assemblies Involving Multipair Bundles
inferred← citeshttps://doi.org/10.4337/9781788973182.00011openalex-snapshot
Stakeholders, issues and the shaping of large engineering projects
inferred← citeshttps://doi.org/10.48550/arxiv.1605.05102openalex-snapshot
Enumeration of Enumeration Algorithms
inferred← citeshttps://doi.org/10.5821/dissertation-2117-95975openalex-snapshot
Multi-layer model predictive control of complex water systems
inferred← citeshttps://doi.org/10.7939/r3-0fr9-dp98openalex-snapshot
Integer-Programming-Assisted Path-Float-Based Method for Time-Cost Tradeoff Optimization in Project Planning
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.