Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,280,278 papers from all fields of science
Search
Sign In
Create Free Account
Configuration graph
Configuration graphs are a theoretical tool used in computational complexity theory to prove a relation between graph reachability and complexity…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Complete (complexity)
Computational complexity theory
Deterministic finite automaton
Graph (discrete mathematics)
Expand
Broader (1)
Graph theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Cellular Decomposition for Nonrepetitive Coverage Task With Minimum Discontinuities
Tong Yang
,
J. V. Miró
,
Qianen Lai
,
Yue Wang
,
R. Xiong
IEEE/ASME transactions on mechatronics
2020
Corpus ID: 210919975
A mechanism to derive nonrepetitive coverage path solutions with a proven minimal number of discontinuities is proposed in this…
Expand
2018
2018
Test of Reconfigurable Modules in Scan Networks
R. Cantoro
,
Farrokh Ghani Zadegan
,
M. Palena
,
P. Pasini
,
E. Larsson
,
M. Reorda
IEEE transactions on computers
2018
Corpus ID: 53288022
Modern devices often include several embedded instruments, such as BIST interfaces, sensors, calibration facilities. New…
Expand
2012
2012
History-Register Automata
Radu Grigore
,
Nikos Tzevelekos
Log. Methods Comput. Sci.
2012
Corpus ID: 3488572
Programs with dynamic allocation are able to create and use an unbounded number of fresh resources, such as references, objects…
Expand
2012
2012
Software-Based Testing for System Peripherals
M. Grosso
,
Wilson Javier Perez Holguin
,
E. Sánchez
,
M. Reorda
,
A. Tonda
,
J. Velasco-Medina
Journal of electronic testing
2012
Corpus ID: 10425633
Software-based self-testing strategies have been mainly proposed to tackle microprocessor testing, but may also be applied to…
Expand
2012
2012
Supplier selection problem revisited from the perspective of product configuration
Duck-Young Kim
,
Stephan M. Wagner
2012
Corpus ID: 110945666
Collaboration with suppliers is essential for developing and producing a competitive product and it begins with selecting the…
Expand
2008
2008
The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
Á. Corberán
,
Isaac Plana
,
J. Sanchis
SIAM Journal on Discrete Mathematics
2008
Corpus ID: 17964133
The windy postman problem consists of finding a minimum cost traversal of all of the edges of an undirected graph with two costs…
Expand
2007
2007
A graph approach to computing nondeterminacy in substitutional dynamical systems
T. M. Carlsen
,
S. Eilers
RAIRO - Theoretical Informatics and Applications
2007
Corpus ID: 11330286
We present an algorithm which for any aperiodic and primitive substitution outputs a finite representation of each special word…
Expand
2006
2006
Bounded Analysis and Decomposition for Behavioural Descriptions of Components
P. Poizat
,
J. Royer
,
Gwen Salaün
International Conference on Formal Methods for…
2006
Corpus ID: 6711589
Explicit behavioural interfaces are now accepted as a mandatory feature of components to address architectural analysis…
Expand
2003
2003
Automatic graphs and D0L-sequences of finite graphs
Olivier Ly
Journal of computer and system sciences (Print)
2003
Corpus ID: 42311027
2000
2000
Automatic Graphs and Graph D0L-Systems
Olivier Ly
International Symposium on Mathematical…
2000
Corpus ID: 1912019
The concept of end is a classical mean of understanding the behavior of a graph at infinity. In this respect, we show that the…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required