Theories of Hypergraph-Graph (HG(2)) Data Structure
Shiladitya Munshi, Ayan Chakraborty, Debajyoti Mukhopadhyay
Abstract
Open-access reader
Shiladitya Munshi, Ayan Chakraborty, Debajyoti Mukhopadhyay
Abstract
Open-access reader
Current paper introduces a Hypergraph Graph model of data storage which can be represented as a hybrid data structure based on Hypergraph and Graph. The pro-posed data structure is claimed to realize complex combinatorial structures. The formal definition of the data structure is presented along with the proper justification from real world scenarios. The paper reports some elementary concepts of Hypergraph and presents theoretical aspects of the proposed data structure including the concepts of Path, Cycle etc. The detailed analysis of weighted HG 2 is presented along with discussions on Cost involved with HG 2 paths.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Current paper introduces a Hypergraph Graph model of data storage which can be represented as a hybrid data structure based on Hypergraph and Graph. The pro-posed data structure is claimed to realize complex combinatorial structures. The formal definition of the data structure is presented along with the proper justification from real world scenarios. The paper reports some elementary concepts of Hypergraph and presents theoretical aspects of the proposed data structure including the concepts of Path, Cycle etc. The detailed analysis of weighted HG 2 is presented along with discussions on Cost involved with HG 2 paths.
Key concepts: Hypergraph, Data structure, Graph, Theoretical computer science, Computer science, Graph theory, Path (computing), Algorithm