Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
BisimulationCategory theoryDiagramDirected acyclic graph

Broader (2)

Formal methodsTheoretical computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
A CSP implementation of the directed bigraph embedding problem
Directed bigraphs are a meta-model which generalises Milner's bigraphs by taking into account the request flow between controls… 
2018
2018
Linear-Time In-Place DFS and BFS in the Restore Model
We present an in-place depth first search (DFS) and an in-place breadth first search (BFS) that runs on a word RAM in linear time… 
2017
2017
News Filtering and Summarization System Architecture for Recognition and Summarization of News Pages
---Due to the swift development of text documents, document clustering has turned out to be one of the foremost techniques for… 
2011
2011
Named Entity Recognition for User-Generated Tags
Content Based Multimedia Retrieval on nontextual documents is often constrained by available metadata. User-generated tags… 
2009
2009
The Methodology of Manual Assessment in the Evaluation of Link Discovery
The link graph extracted from the Wikipedia has often been used as the ground truth for measuring the performance of automated… 
2004
2004
Coinductive Reasoning for Contextual Graph-Rewriting
We introduce a comprehensive semantic theory of graph rewriting. The theory is operational, and therefore, lends itself to the… 
2004
2004
Link Structure of Hierarchical Information Networks
One feature that seems to have been largely ignored in previous models of the Web is the inherent hierarchy that is evident in… 
2001
2001
QUALITATIVE SPATIAL REASONING BASED ON ALGEBRAIC TOPOLOGY
Several formalisms have been proposed for qualitative reasoning about regions and their topological relations in space. These… 
2000
2000
Dynamic miss-counting algorithms: finding implication and similarity rules with confidence pruning
Dynamic miss-counting (DMC) algorithms are proposed which find all implication and similarity rules with confidence pruning but… 
1994
1994
Statistical Identiication of Language
A statistically based program has been written which learns to distinguish between languages. The amount of training text that…