Skip to search formSkip to main contentSkip to account menu

Configuration graph

Configuration graphs are a theoretical tool used in computational complexity theory to prove a relation between graph reachability and complexity… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
A mechanism to derive nonrepetitive coverage path solutions with a proven minimal number of discontinuities is proposed in this… 
2018
2018
Modern devices often include several embedded instruments, such as BIST interfaces, sensors, calibration facilities. New… 
2012
2012
Programs with dynamic allocation are able to create and use an unbounded number of fresh resources, such as references, objects… 
2012
2012
Software-based self-testing strategies have been mainly proposed to tackle microprocessor testing, but may also be applied to… 
2012
2012
Collaboration with suppliers is essential for developing and producing a competitive product and it begins with selecting the… 
2008
2008
The windy postman problem consists of finding a minimum cost traversal of all of the edges of an undirected graph with two costs… 
2007
2007
We present an algorithm which for any aperiodic and primitive substitution outputs a finite representation of each special word… 
2006
2006
Explicit behavioural interfaces are now accepted as a mandatory feature of components to address architectural analysis… 
2003
2003
  • Olivier Ly
  • 2003
  • Corpus ID: 42311027
2000
2000
The concept of end is a classical mean of understanding the behavior of a graph at infinity. In this respect, we show that the…