Ranks and Partial Cuts in Forward Hypergraphs

Ranks and Partial Cuts in Forward Hypergraphs

Many real-world relations are networks that can be modelled with a kind of directed hypergraph named a forward hypergraph (F-graph). F-graphs capture the semantics of both conjunctive and disjunctive dependency relations. Logic statements are sometimes represented using AND/OR directed graphs and th...

Full description

Bibliographic Details
Main Author: Sawilla, Reginald Elias
Other Authors: Queen's University (Kingston, Ont.). Theses (Queen's University (Kingston, Ont.))
Language:en
en
Published: 2011
Subjects:
hypergraph ranks
hypergraph cuts
cyber security
decision support
Online Access:http://hdl.handle.net/1974/6484

Internet

http://hdl.handle.net/1974/6484

Similar Items