Skip to search formSkip to main contentSkip to account menu

Loop (graph theory)

Known as: Graph loop, Loop, Self-loop 
In graph theory, a loop (also called a self-loop or a "buckle") is an edge that connects a vertex to itself. A simple graph contains no loops… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We study asymptotic properties of Fisher memory of linear Echo State Networks with randomized reservoir coupling prescribed by… 
2011
2011
Vélo’v 
2011
2011
The multiarrow formalism for coupled cell networks permits multiple arrows and self-loops. The Lifting Theorem states that any… 
2010
2010
A technique for calibrating a network of perspective cameras based on their graph of trifocal tensors is presented. After… 
2008
2008
The problem of minimizing communication in a distributed networked system is considered in a discrete-event formalism where the… 
2004
2004
Petri nets (PNs) are a reliable graphical and mathematical modeling tool for the formal modeling and validation of systems (W… 
2001
2001
  • A. GiuaC. Seatzu
  • 2001
  • Corpus ID: 58050988
We deal with the problem of designing control logic for railway networks using Petri nets. We first use the framework of… 
Review
1991
Review
1991
The authors present Pascant, a system that consists of an intelligent partial-scan flip-flop-selection algorithm and a sequential…