Configuration graph

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

Topic mentions per year

Topic mentions per year

1984-2018
02419842018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
The programming complexity of increasingly parallel processors calls for new tools to assist programmers in utilising the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table III
Is this relevant?
Review
2009
Review
2009
We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has… (More)
  • figure 1
Is this relevant?
2008
2008
Configurations of type (κ +1)κ give rise to κ–regular simple graphs via configuration graphs. On the other hand, neighbourhood… (More)
  • figure 1
  • figure 2
Is this relevant?
2007
2007
  • Tun Lu, Ning Gu
  • First Joint IEEE/IFIP Symposium on Theoretical…
  • 2007
Service-oriented computing (SOC) emerging as a new computing diagram that supports the rapid and low-cost development of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
This paper proposes a methodology to analyze graph transformation systems by means of Alloy and its supporting tools. Alloy is a… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2006
2006
New developments and decreasing costs of electronic appliances enable the realization of pervasive systems in our daily… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Software architectures have recently emerged as a level of design concerned with specifying the overall structure of a system… (More)
  • figure 1
  • figure 2
  • table 1
Is this relevant?
2001
2001
The provision of distributed multimedia services is becoming mobile and ubiquitous. Different multimedia services require… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Robot configuration design is hampered by the lack of established, well-known design rules, and designers cannot easily grasp the… (More)
  • table 1.1
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • table 1.2
Is this relevant?
Highly Cited
1984
Highly Cited
1984
  • R. Nackman Lee
  • IEEE Transactions on Pattern Analysis and Machine…
  • 1984
The configuration of the critical points of a smooth function of two variables is studied under the assumption that the function… (More)
  • figure 1
  • figure 2
  • table I
  • figure 5
  • figure 4
Is this relevant?