10.9k citations
- Eötvös Loránd UniversityHU211 papers
- Konkoly ObservatoryHU206 papers
- Centre National de la Recherche ScientifiqueFR166 papers
- Institute for Solid State Physics and OpticsHU166 papers
- HUN-REN Wigner Research Centre for PhysicsHU155 papers
- HUN-REN Research Centre for Astronomy and Earth SciencesHU132 papers
- Budapest University of Technology and EconomicsHU124 papers
- HUN-REN Alfréd Rényi Institute of MathematicsHU104 papers
- HUN-REN Institute for Nuclear ResearchHU98 papers
- The University of TokyoJP94 papers
- University of DebrecenHU93 papers
- University of Tennessee at KnoxvilleUS82 papers
4 papers · 2 filters
Borel oracles. An analytical approach to constant-time algorithms
Gabor Elek, Gabor Lippner
Nguyen and Onak constructed the first constant-time algorithm for the approximation of the size of the maximum matching in bounded degree graphs. The Borel oracle machinery is a to…
On directed local chromatic number, shift graphs, and Borsuk-like graphs
Gábor Simonyi, Gábor Tardos
We investigate the local chromatic number of shift graphs and prove that it is close to their chromatic number. This implies that the gap between the directed local chromatic numbe…
Finding bipartite subgraphs efficiently
D. Mubayi, G. Turan
Polynomial algorithms are given for the following two problems: given a graph with vertices and edges, where , find a complete balanced bipartite subgraph…
Degree-based graph construction
Hyunju Kim, Zoltan Toroczkai, Péter L. Erdős +2
Degree-based graph construction is an ubiquitous problem in network modeling, ranging from social sciences to chemical compounds and biochemical reaction networks in the cell. This…