Bigraph

Known as: Bigraphs, Link graph, Place graph 
A bigraph (often used in the plural bigraphs) can be modelled as the superposition of a graph (the link graph) and a set of trees (the place graph… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1963-2018
010203019632018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Formal models of indoor space for reasoning about navigation tasks should capture key static and dynamic properties and… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
We present a novel approach to modelling the evolution of spatial entities over time by using bigraphs. We use the links in a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
Milner’s bigraphical reactive systems [7], or BRSs in short, are formulated in terms of category theory. They encompass earlier… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
2007
2007
We describe a provably sound and complete matching algorithm for bigraphical reactive systems. The algorithm has been implemented… (More)
  • figure 2
  • table 1
  • figure 6
  • figure 7
  • figure 11
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Bigraphs are graphs whose nodes may be nested, representing locality, independently of the edges connecting them. They may be… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
A bigraphical reactive system (BRS) involves bigraphs, in which the nesting of nodes represents locality, independently of the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2001
2001
The bigraph crossing problem, embedding the two node sets of a bipartite graph along two parallel lines so that edge crossings… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
1999
1999
The bigraph crossing problem, embedding the two node sets of a bipartite graph G = (V0; V1; E) along two parallel lines so that… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1999
1999
The bigraph crossing problem, embedding the two vertex sets of a bipartite graph G = (V0; V1; E) along two parallel lines so that… (More)
  • figure 8
Is this relevant?
1980
1980
It was observed by Dulmage and Mendelsohn in their work on matrix reducibility that there is a one-to-one correspondence between… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?