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)

Semantic Scholar uses AI to extract papers important to this topic.

2012

2012

- Lisa Walton, Michael F. Worboys
- GIScience
- 2012

Formal models of indoor space for reasoning about navigation tasks should capture key static and dynamic properties and… (More)

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)

Is this relevant?

2011

2011

- Maxime Beauquier, Carsten Schürmann
- LFMTP
- 2011

Milner’s bigraphical reactive systems [7], or BRSs in short, are formulated in terms of category theory. They encompass earlier… (More)

Is this relevant?

2007

2007

We describe a provably sound and complete matching algorithm for bigraphical reactive systems. The algorithm has been implemented… (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- Robin Milner
- Inf. Comput.
- 2006

Bigraphs are graphs whose nodes may be nested, representing locality, independently of the edges connecting them. They may be… (More)

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)

Is this relevant?

2001

2001

- Matthias F. Stallmann, Franc Brglez, Debabrata Ghosh
- ACM Journal of Experimental Algorithmics
- 2001

The bigraph crossing problem, embedding the two node sets of a bipartite graph along two parallel lines so that edge crossings… (More)

Is this relevant?

1999

1999

- Matthias F. Stallmann, Franc Brglez, Debabrata Ghosh
- ISCAS
- 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)

Is this relevant?

1999

1999

- Matthias F. Stallmann, Franc Brglez, Debabrata Ghosh
- ALENEX
- 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)

Is this relevant?

1980

1980

- Richard A. Brualdi, Frank Harary, Zevi Miller
- Journal of Graph Theory
- 1980

It was observed by Dulmage and Mendelsohn in their work on matrix reducibility that there is a one-to-one correspondence between… (More)

Is this relevant?