A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
A competitive algorithm in searching for many edges in a hypergraph
2007
Discrete Applied Mathematics
Preserved Fulltext
We give a competitive algorithm to identify all d defective edges in a hypergraph with d unknown. ...
We give a competitive algorithm where d is unknown. ...
Johann for a careful reading of the paper and many helpful suggestions. We also thank the reviewers for their efforts to improve the readability of this paper. ...
doi:10.1016/j.dam.2006.07.008
fatcat:qb43g5hzknditlsvwxvdqptodu
Page 7849 of Mathematical Reviews Vol. , Issue 2003j
[page]
2003
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
This paper investigates a variant of on-line edge-coloring in which a fixed number k of edges is given and the aim is to color as many edges as possible under the constraint that no two adjacent edges ...
For k-uniform hypergraphs with n vertices, it ob- tains a ratio of A —(1 —o(1))(kKInInn)/Inn for large n; and for k-uniform hypergraphs of maximum degree A, it obtains a ratio of k — (1 —o(1))(k(A — 1) ...
Flexible Support Measures and Search Schemes for Mining Frequent Patterns in a Large Single Graph
2017
Proceedings of the 2017 ACM International Conference on Management of Data - SIGMOD '17
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The second one is an algorithm for searching through the space of all possible subgraphs to identify frequent ones. ...
In particular, researchers are interested in finding all frequent patterns from a single graph that often consists of a large number of vertices and edges. ...
I am developing a new pattern generation algorithm and search scheme for FSM in large graphs. ...
doi:10.1145/3055167.3055177
fatcat:vktszonwlfh6vmobouje6i4y7e
The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Constraint Satisfaction Problems (CSPs) play a central role in many applications in Artificial Intelligence and Operations Research. In general, solving CSPs is NP-complete. ...
However, also the computation of a concrete hypergraph decomposition is a challenging task in itself. ...
Georg Gottlob is a Royal Society Research Professor and acknowledges support by the Royal Society for the present work in the context of the project "RAISON DATA" (Project reference: RP\R1\201074). ...
arXiv:2012.14762v1
fatcat:3xv3r4doxza47nu2uobydqkfwq
Memetic Multilevel Hypergraph Partitioning
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Hypergraph partitioning has a wide range of important applications such as VLSI design or scientific computing. ...
Compared to the state-of-the-art hypergraph partitioning tools hMetis, PaToH, and KaHyPar, our new algorithm computes the best result on almost all instances. ...
Bui and Moon [15] present a steady-state MA for ratio cut bipartitioning of hypergraphs, which uses a weak variation of the FM algorithm [28] as local search engine. ...
arXiv:1710.01968v2
fatcat:4msekcj2nfa7bgghtqbsr5uxeu
Evolutionary n-level Hypergraph Partitioning with Adaptive Coarsening
2019
IEEE Transactions on Evolutionary Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The results show that we have identified a valuable role for evolutionary algorithms within the current state-of-the-art hypergraph partitioning framework. ...
Hypergraph partitioning is an NP-hard problem that occurs in many computer science applications where it is necessary to reduce large problems into a number of smaller, computationally tractable sub-problems ...
ACKNOWLEDGMENT The authors would like to thank the Karlsruhe Institute of Technology for KaHyPar and benchmark hypergraphs, and M. Pelikan for his implementations of the BOA algorithm. ...
doi:10.1109/tevc.2019.2896951
fatcat:g5iisls3efgidcnakmfot4simu
High-Quality Hypergraph Partitioning
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Optionally, a memetic algorithm evolves a pool of solution candidates to obtain even higher quality. We evaluate KaHyPar on a large set of instances from a wide range of application domains. ...
While reversing the contractions, a combination of highly-localized direct k-way local search and flow-based techniques that take a more global view, refine the partition to achieve high quality. ...
This work was partially supported by DFG grants WA654/19-2, SA933/10-2, SA933/11-1, SCHU 2567/1-2, and the Leibniz prize for Peter Sanders. ...
arXiv:2106.08696v1
fatcat:fxzmuig7f5hztddtyvny5ra2va
Combining Two Local Search Approaches to Hypergraph Partitioning
2003
International Joint Conference on Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We study leading-edge local search heuristics for balanced hypergraph partitioning and Boolean satisfiability, intending the generalization of such heuristics beyond their original domains. ...
Empirically, we show a 15% improvement in net cut and a 7% improvement in runtime over a leading-edge implementation of the FM heuristic. ...
The WalkPart Algorithm The WalkPart algorithm is a stochastic local search algorithm for balance-constrained hypergraph bisection. ...
dblp:conf/ijcai/RamaniM03
fatcat:2nahz6kwobb4lpo4ojcmvwr4ju
A backtracking-based algorithm for hypertree decomposition
2009
ACM Journal of Experimental Algorithmics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In this paper, we present the new backtracking-based algorithm det-k-decomp for computing hypertree decompositions of small width. ...
Even compared to the best heuristic algorithm, we obtained competitive results as long as the hypergraphs are not too large. ...
-In their paper, the authors suggest an algorithm that, for a problem and given k , finds a hypertree decomposition of width at most k (if one exists) in polynomial time . • First step: Nondeterministic ...
doi:10.1145/1412228.1412229
fatcat:gv4ciirpg5hahgqkxwklpbbun4
Scalable Graph Algorithms
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Analyzing these structures aids us in gaining new insights about our surroundings. As huge networks become abundant, there is a need for scalable algorithms to perform analysis. ...
This habilitation thesis is a summary a broad spectrum of scalable graph algorithms that I developed over the last six years with many coauthors. ...
While the grants are acknowledged in the individual papers, we also acknowledge them here. ...
arXiv:1912.00245v1
fatcat:mop2e6pqtnbr7irkrakraael6a
Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
A well-known conjecture of Füredi, Kahn, and Seymour (1993) on non-uniform hypergraph matching states that for any hypergraph with edge weights w, there exists a matching M such that the inequality ∑_e ...
Actually, their method works in a more general sampling setting, where, given a point x of the canonical LP relaxation, the task is to efficiently sample a matching M containing each edge e with probability ...
Acknowledgments The authors would like to thank David Harris for suggesting the elegant formulation of Theorem 4 in the Appendix. ...
arXiv:2009.00697v2
fatcat:5zgm2ddrlfembndvesk7hstemy
Strong Colorings of Hypergraphs
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph coloring problems. ...
We present nearly tight upper and lower bound on approximating general hypergraphs, both offline and online. ...
Morris Jr. for many helpful discussions regarding integer programming. ...
doi:10.1007/978-3-540-31833-0_21
fatcat:wpgt4mjnfbaldfxx26dyyssyoe
Network Flow-Based Refinement for Multilevel Hypergraph Partitioning
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
By reducing the size of hypergraph flow networks, improving the flow model used in KaFFPa, and developing techniques to improve the running time of our algorithm, we obtain a partitioner that computes ...
the best solutions for a wide range of benchmark hypergraphs from different application areas while still having a running time comparable to that of hMetis. ...
greedy algorithms [32, 33] for local search. ...
arXiv:1802.03587v2
fatcat:n4poiwo7ivaovpuk7xhnskk7l4
Algorithms for Secretary Problems on Graphs and Hypergraphs
[article]
2008
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Perhaps of more interest is the fact that our analysis is easily extended to obtain competitive algorithms for similar problems, such as to find disjoint sets of edges in hypergraphs where edges arrive ...
We develop an 8-competitive algorithm for the following secretary problem: Initially given R, and the size of L, the algorithm receives the vertices of L sequentially, in a random order. ...
Muthukrishnan for helpful discussions on BVM and related problems. ...
arXiv:0807.1139v1
fatcat:e4nzomzzpvahvmstmca3simati
Community Detection in a Weighted Directed Hypergraph Representation of Cell-to-cell Communication Networks
[article]
2020
bioRxiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
In this work, we model the ligand-receptor-mediated cell-to-cell communication network as a weighted directed hypergraph. ...
We first define the community structures in a weighted directed hypergraph and develop an exact community detection method to identify these communities. ...
Elena Denisenko for her insightful comments. This ...
doi:10.1101/2020.11.16.381566
fatcat:eryimtip7ffzled42oqmuhshiu
« Previous
Showing results 1 — 15 out of 1,339 results