Journal Article10.1016/j.tcs.2022.02.016
Weighted 2-sections and hypergraph reconstruction
TL;DR: In this article , the notion of weighted 2-sections of hypergraphs with integer weights was introduced and the following hypergraph reconstruction problems were studied: given a weighted graph G,w, is there a hypergraph H such that (G,w) is its weighted 2section?
read more
Abstract: In the paper we introduce the notion of weighted 2-sections of hypergraphs with integer weights and study the following hypergraph reconstruction problems: Given a weighted graph (G,w), is there a hypergraph H such that (G,w) is its weighted 2-section? Given a weighted 2-section (G,w), find a hypergraph H such that (G,w) is its weighted 2-section.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
References
•Book
Graph theory
Frank Harary
- 01 Jan 1969
TL;DR: This project focuses on Tutte’s work in cryptography, which enabled the British to read high-level German army messages and has been described as one of the greatest intellectual feats of the war.
18K
Algorithmic Aspects of Vertex Elimination on Graphs
TL;DR: A graph-theoretic elimination process which is related to performing Gaussian elimination on sparse symmetric positive definite systems of linear equations is considered, and it is conjecture that the problem of finding a minimum ordering is NP-complete.
1.4K
The NP-Completeness of Edge-Coloring
TL;DR: It is shown that it is NP-complete to determine the chromatic index of an arbitrary graph, even for cubic graphs.
1.3K
•Book
Hypergraphs: Combinatorics of Finite Sets
Claude Berge
- 11 Jul 2011
TL;DR: This chapter discusses Hypergraphs Generalising Bipartite Graphs, which are a collection of hypergraphs designed to solve the problem of Uniform Colourings in Matroids, and some of the properties of these graphs.
1K
The recognition of Series Parallel digraphs
Jacobo Valdes,Robert E. Tarjan,Eugene L. Lawler +2 more
- 30 Apr 1979
TL;DR: An algorithm is presented that recognizes the class of General Series Parallel digraphs and runs in time proportional to the size of its input and calculates the transitive reduction and transitive closure of any General Series parallel digraph.
676