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.
2018
2018
In this paper, distributed linear convolutional space-time coding (DLC-STC) for two relay full-duplex (FD) $2\times 2\times 2… 
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 
2008
2008
In this paper, we propose a model named Logical Markov Decision Processes with Negation for Relational Reinforcement Learning for… 
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… 
1998
1998
A popular approach to reduce power consumption is to identify self-loops in a state transition graph (STG) of a finite state…