Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey | Paper Citation Record

Observation 2ef7ba90-0795-4be3-8860-bfd7c94800ec · outbound

This paper cites Higher order learning with graphs.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Higher order learning with graphs

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:31.599367Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9ed27ea5-74fd-4cab-8ad2-631e0f531e89 · outbound

This paper cites HyperEF: Spectral hypergraph coarsening by effective-resistance clustering.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey HyperEF: Spectral hypergraph coarsening by effective-resistance clustering

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:31.651768Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation de24793b-c250-4e67-917d-0d18962cbf38 · outbound

This paper cites Visualisation and analysis of the Internet Movie Database.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Visualisation and analysis of the Internet Movie Database

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:31.726261Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 662befb6-982b-448d-85d2-60743e6765d7 · outbound

This paper cites Hypergraph Laplacians in diffusion framework.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Hypergraph Laplacians in diffusion framework

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:31.849129Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9cd525c7-0184-4460-985b-008b4ff89800 · outbound

This paper cites Alsing, Jonathan R.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Alsing, Jonathan R

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:31.921893Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9a89f5fc-0d1f-4e1c-bacb-f83d33c293ad · outbound

This paper cites Curvature of hypergraphs via multi-marginal optimal transport.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Curvature of hypergraphs via multi-marginal optimal transport

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:31.994578Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5bf50d09-7b89-4840-b5df-cb8410f8ba51 · outbound

This paper cites On the sum of Ricci-curvatures for weighted graphs.Pure and Applied Mathematics Quarterly, 2020.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey On the sum of Ricci-curvatures for weighted graphs.Pure and Applied Mathematics Quarterly, 2020

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:32.068329Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f2b50d9b-a427-4f2a-ae08-e597174e3b6f · outbound

This paper cites On the spectrum of hypergraphs.Linear Algebra and its Applications, 614:82–110, April 2021.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey On the spectrum of hypergraphs.Linear Algebra and its Applications, 614:82–110, April 2021

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:32.132383Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0a7caf8e-ac49-49d7-ab5e-ec920709f3b7 · outbound

This paper cites New notions and constructions of sparsifica- tion for graphs and hypergraphs.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey New notions and constructions of sparsifica- tion for graphs and hypergraphs

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:32.220687Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4ee0103f-2b30-4019-b33d-26ee64332c8f · outbound

This paper cites Geometric sampling of networks.Journal of Complex Networks, 10(4):cnac014, August 2022.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Geometric sampling of networks.Journal of Complex Networks, 10(4):cnac014, August 2022

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:32.313123Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 38008e61-56d7-423e-9ec9-c9d2b0d22e1c · outbound

This paper cites Spielman, and Nikhil Srivastava.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Spielman, and Nikhil Srivastava

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:32.374028Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bc3ef486-c24d-4ac0-8a09-52603f1c4618 · outbound

This paper cites Ollivier–Ricci curvature and the spectrum of the normalized graph Laplace operator.Mathematical Research Letters, 19(6):1185–1205, 2012.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Ollivier–Ricci curvature and the spectrum of the normalized graph Laplace operator.Mathematical Research Letters, 19(6):1185–1205, 2012

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:32.456935Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b51954a5-45b6-459f-aac4-a3165323083c · outbound

This paper cites The Morse theory of ˇCech and Delaunay complexes.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey The Morse theory of ˇCech and Delaunay complexes

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:32.606984Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e799ba95-4857-4178-bc7e-f533785af2c8 · outbound

This paper cites Bencz´ ur and David R.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Bencz´ ur and David R

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:32.712306Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a2ada6f0-af64-42e0-a05a-ae9f43cfeb95 · outbound

This paper cites Benson, David F.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Benson, David F

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:32.840170Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e6d6c9b4-1701-43c9-8489-6a9640c036ee · outbound

This paper cites Nature of hypergraph k-core percolation problems.Physical Review E, 109(1):014307, 2024.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Nature of hypergraph k-core percolation problems.Physical Review E, 109(1):014307, 2024

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:32.927385Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bffafbd1-93ad-4f5e-9b29-8f028f1a8563 · outbound

This paper cites Theory of percolation on hypergraphs.Physical Review E, 109(1):014306, 2024.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Theory of percolation on hypergraphs.Physical Review E, 109(1):014306, 2024

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:32.983308Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 451b80e0-0104-46ed-b19f-82eef2d0ba79 · outbound

This paper cites On the stability of interval decomposable persistence modules.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey On the stability of interval decomposable persistence modules

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:33.089037Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b856567b-160e-49cd-95c3-a0a1b686dc20 · outbound

This paper cites Fast unfolding of communities in large networks.Journal of Statistical Mechanics: Theory and Experiment, 2008(10):P10008, oct 2008.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Fast unfolding of communities in large networks.Journal of Statistical Mechanics: Theory and Experiment, 2008(10):P10008, oct 2008

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:33.247487Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a81966a4-ac10-4715-a106-df14cb723eec · outbound

This paper cites Homological percolation and the Euler characteristic.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Homological percolation and the Euler characteristic

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:33.361400Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a372263d-43d3-4854-a746-6d9301ef9515 · outbound

This paper cites Mass transportation and rough curvature bounds for discrete spaces.Journal of Functional Analysis, 256(9):2944–2966, 2009.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Mass transportation and rough curvature bounds for discrete spaces.Journal of Functional Analysis, 256(9):2944–2966, 2009

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:33.437907Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d7837b7f-9cc2-4a34-a739-7dad54a96984 · outbound

This paper cites Decomposition of persistence modules.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Decomposition of persistence modules

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:33.558400Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8ad0dec8-e68b-4019-a75a-a704293cda97 · outbound

This paper cites Dey, and Yusu Wang.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Dey, and Yusu Wang

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:33.665805Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 102b579f-504c-4834-a9a5-2b15e6f032ba · outbound

This paper cites Approximating persistent homology for large datasets.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Approximating persistent homology for large datasets

Reference 24

Resolution: verified exact; raw_fallback, observed 2026-08-07T05:20:38.732433Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 13af413d-c089-4ead-b9a2-f7d4df7ca92e · outbound

This paper cites Cavanna, Mahmoodreza Jahanseir, and Donald R.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Cavanna, Mahmoodreza Jahanseir, and Donald R

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:33.877398Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 05b0f50b-6842-4e21-9d0f-c8d61bf4d798 · outbound

This paper cites Spectral properties of hypergraph Laplacian and approximation algorithms.Journal of the ACM, 65(3):1–48, 2018.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Spectral properties of hypergraph Laplacian and approximation algorithms.Journal of the ACM, 65(3):1–48, 2018

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:34.042590Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d3c1c0a5-728d-4076-9f79-2d763910462c · outbound

This paper cites Minimum cuts and sparsification in hypergraphs.SIAM Journal on Computing, 47(6):2118–2156, 2018.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Minimum cuts and sparsification in hypergraphs.SIAM Journal on Computing, 47(6):2118–2156, 2018

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:34.124438Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 56cac3b0-778c-44a4-8a4c-497e0d550c01 · outbound

This paper cites FastGCN: Fast learning with graph convolutional networks via importance sampling.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey FastGCN: Fast learning with graph convolutional networks via importance sampling

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:34.293450Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 79925ead-8356-4bfd-bc67-edb77abf05b0 · outbound

This paper cites Graph coarsening: from scientific computing to machine learning.SeMA Journal.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Graph coarsening: from scientific computing to machine learning.SeMA Journal

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:34.360258Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 83e60dd2-48c3-44f0-b658-dd05005a2db0 · outbound

This paper cites Near-linear size hypergraph cut sparsifiers.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Near-linear size hypergraph cut sparsifiers

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:34.493599Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4979d8ca-f718-4d75-bedb-7d7aadac14b4 · outbound

This paper cites Demystifying graph sparsification algorithms in graph properties preservation.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Demystifying graph sparsification algorithms in graph properties preservation

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:34.648161Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation af97da5a-e51b-494e-88f9-cddbf247919b · outbound

This paper cites Community detection in hypergraphs: Optimal statistical limit and efficient algorithms.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Community detection in hypergraphs: Optimal statistical limit and efficient algorithms

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:34.780049Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2c2009a4-6c7a-45a0-805e-4c9d5e1c2390 · outbound

This paper cites Combinatorial Ricci flows on surfaces.Journal of Differential Geometry, 63(1):97–129, 2003.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Combinatorial Ricci flows on surfaces.Journal of Differential Geometry, 63(1):97–129, 2003

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:34.912573Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a8a0bfa9-565e-4958-a6da-dc977cb5e6f3 · outbound

This paper cites Ollivier-Ricci curvature for hypergraphs: A unified framework.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Ollivier-Ricci curvature for hypergraphs: A unified framework

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:35.046936Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8160f531-5968-4716-92d4-c059879f834c · outbound

This paper cites Decomposition of pointwise finite-dimensional persistence modules.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Decomposition of pointwise finite-dimensional persistence modules

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:35.178353Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 14b5c40a-ce36-49d4-945c-ec2192a7a2fa · outbound

This paper cites Coverage in sensor networks via persistent homology.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Coverage in sensor networks via persistent homology

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:35.318842Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c96670a9-a9a2-451d-9e00-93bd8c6da5de · outbound

This paper cites Discrete curvature on graphs from the effective resistance.Journal of Physics: Complexity, 3(2), 2022.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Discrete curvature on graphs from the effective resistance.Journal of Physics: Complexity, 3(2), 2022

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:35.420776Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0200ce5e-3837-4dce-94cd-ee64f167056e · outbound

This paper cites Graph curvature via resistance distance.Discrete Applied Mathematics, 348:68–78, 2024.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Graph curvature via resistance distance.Discrete Applied Mathematics, 348:68–78, 2024

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:35.542565Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7bf75de6-05dd-473f-9e45-7638c6326200 · outbound

This paper cites Dey, Fengtao Fan, and Yusu Wang.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Dey, Fengtao Fan, and Yusu Wang

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:35.687250Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 14d8b639-6d87-4cb1-827a-cc161991672b · outbound

This paper cites Dey, Dayu Shi, and Yusu Wang.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Dey, Dayu Shi, and Yusu Wang

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:35.825180Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3f4a615f-311b-4a9d-b447-64ee93d493bc · outbound

This paper cites The density of expected persistence diagrams and its kernel based estimation.Journal of Computational Geometry, 10(2):127–153, 2019.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey The density of expected persistence diagrams and its kernel based estimation.Journal of Computational Geometry, 10(2):127–153, 2019

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:36.020260Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3fed3860-1962-40f3-9578-62ad643f3cf7 · outbound

This paper cites Estimation and quantization of expected persistence diagrams.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Estimation and quantization of expected persistence diagrams

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:36.159200Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d857c68e-5611-45bf-9e14-4c3b511e47b2 · outbound

This paper cites A notion of harmonic clustering in simplicial complexes.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey A notion of harmonic clustering in simplicial complexes

Reference 43

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:36.282052Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bb96244e-fa37-410e-9fb6-856f923e4d92 · outbound

This paper cites Persistent homology-a survey.Contemporary Mathe- matics, 453:257–282, 2008.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Persistent homology-a survey.Contemporary Mathe- matics, 453:257–282, 2008

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:36.384296Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 58f91b4c-88c9-43a5-963e-34efc02e8340 · outbound

This paper cites American Mathematical Society, 2022.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey American Mathematical Society, 2022

Reference 45

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:36.470970Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 768348ee-cdcb-436c-818f-b485ba92eac5 · outbound

This paper cites Edge- based analysis of networks: curvatures of graphs and hypergraphs.Theory in Biosciences, 139(4):337–348, December 2020.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Edge- based analysis of networks: curvatures of graphs and hypergraphs.Theory in Biosciences, 139(4):337–348, December 2020

Reference 46

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:36.622807Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4ef6088e-52a3-4322-95e9-9c7a74eb82e1 · outbound

This paper cites Ollivier Ricci curvature of directed hypergraphs.Scientific Reports, 10(1):12466, 2020.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Ollivier Ricci curvature of directed hypergraphs.Scientific Reports, 10(1):12466, 2020

Reference 47

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:36.729577Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0f10abad-4ed2-48fb-851a-bf92fa1184c7 · outbound

This paper cites Irreducibility of Markov Chains on simplicial complexes, the Spectrum of the Discrete Hodge Laplacian and Homology.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Irreducibility of Markov Chains on simplicial complexes, the Spectrum of the Discrete Hodge Laplacian and Homology

Reference 48

Resolution: verified exact; local_arxiv, observed 2026-08-07T05:20:38.667581Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 261170d8-d713-49b5-841c-c8a9d99700a7 · outbound

This paper cites Multiscale topology of chromatin folding.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Multiscale topology of chromatin folding

Reference 49

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:36.920054Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0b25ac4c-1497-4f6b-a049-c8a584ce5632 · outbound

This paper cites Mitchell, Brenda Praggastis, Amie J.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Mitchell, Brenda Praggastis, Amie J

Reference 50

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:37.048790Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 802a5415-7c1a-46f1-9258-de7a9aaa52bb · outbound

This paper cites Augmentations of Forman’s Ricci curvature and their applications in community detection.Journal of Physics: Complexity, 5(3):035010, 2024.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Augmentations of Forman’s Ricci curvature and their applications in community detection.Journal of Physics: Complexity, 5(3):035010, 2024

Reference 51

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:37.161450Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7ece55f0-c92f-4e9e-a650-0fab69eda135 · outbound

This paper cites Bochner’s method for cell complexes and combinatorial Ricci curvature.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Bochner’s method for cell complexes and combinatorial Ricci curvature

Reference 52

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:37.302570Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ed17d249-1a95-40e7-8cb0-e26dbde90402 · outbound

This paper cites Learning discrete structures for graph neural networks.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Learning discrete structures for graph neural networks

Reference 53

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:37.464301Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a13a1ce6-4f24-43b5-b805-3a475e4e70ca · outbound

This paper cites Directed hypergraphs and applications.Discrete Applied Mathematics, 42(2-3):177–201, 1993.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Directed hypergraphs and applications.Discrete Applied Mathematics, 42(2-3):177–201, 1993

Reference 54

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:37.630291Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 245c0a45-639c-43c3-ada2-e4b676a13955 · outbound

This paper cites A topological measurement of protein compressibility.Japan Journal of Industrial and Applied Mathematics, 32:1–17, March 2014.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey A topological measurement of protein compressibility.Japan Journal of Industrial and Applied Mathematics, 32:1–17, March 2014

Reference 55

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:37.798807Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8ff6fd85-018d-4613-a370-bcb2f2bcc0f5 · outbound

This paper cites Graph condensation: A survey.IEEE Transactions on Knowledge and Data Engineering, 37(4):1819– 1837, 2025.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Graph condensation: A survey.IEEE Transactions on Knowledge and Data Engineering, 37(4):1819– 1837, 2025

Reference 56

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:37.847290Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 604603c5-91ee-4297-a836-de538127b561 · outbound

This paper cites A survey of simplicial, relative, and chain complex homology theories for hypergraphs.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey A survey of simplicial, relative, and chain complex homology theories for hypergraphs

Reference 57

Resolution: verified exact; raw_fallback, observed 2026-08-07T05:20:38.653152Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation f9fcf475-6d87-4ea0-bd26-fcf4f9080cf3 · outbound

This paper cites Polyadic opinion formation: The adaptive voter model on a hypergraph.Annalen der Physik, 2024.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Polyadic opinion formation: The adaptive voter model on a hypergraph.Annalen der Physik, 2024

Reference 58

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:38.048566Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 82a2975c-80a5-4cdc-be1a-53a30b6cd700 · outbound

This paper cites Curvature sets over persistence diagrams.Discrete & Computational Geometry, 72:91–180, 2024.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Curvature sets over persistence diagrams.Discrete & Computational Geometry, 72:91–180, 2024

Reference 59

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:38.155548Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1a947f34-d024-4ea1-8ebd-1de9c00a302f · outbound

This paper cites Unfolding the multiscale structure of networks with dynamical Ollivier-Ricci curvature.Nature Communications, 12(1):4561, 2021.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Unfolding the multiscale structure of networks with dynamical Ollivier-Ricci curvature.Nature Communications, 12(1):4561, 2021

Reference 60

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:38.158968Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bb84891d-d6bd-478c-b33c-d437c660ffba · outbound

This paper cites Modern Birkh¨auser Classics.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Modern Birkh¨auser Classics

Reference 61

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:38.161816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b22df268-0207-4f4b-bfc1-b92b96bd6648 · outbound

This paper cites Metric Ricci curvature for manifolds.Geometry, 2013, 2013.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Metric Ricci curvature for manifolds.Geometry, 2013, 2013

Reference 62

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:38.164679Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ec7a6497-e93a-46e1-aedd-f9d791156fa4 · outbound

This paper cites Aditya Prakash, and Wei Jin.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Aditya Prakash, and Wei Jin

Reference 63

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:38.168040Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 478f5c70-a8d9-42ab-9e04-fc275cc0bc3e · outbound

This paper cites The total variation on hypergraphs - learning on hypergraphs revisited.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey The total variation on hypergraphs - learning on hypergraphs revisited

Reference 64

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:38.170931Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 29455887-6bf0-43e4-a1a4-63c29191e5a8 · outbound

This paper cites Independent component analysis: Algorithms and applications.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Independent component analysis: Algorithms and applications

Reference 65

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:38.173912Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8a7fc061-20d0-4a54-8e03-4c71a3b11fe3 · outbound

This paper cites Multilayer network simplification: Approaches, models and methods.Computer Science Review, 36:100246, 2020.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Multilayer network simplification: Approaches, models and methods.Computer Science Review, 36:100246, 2020

Reference 66

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:38.176604Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ed117228-684e-4e4b-a13b-0be8afa61336 · outbound

This paper cites Comparative analysis of Forman-Ricci curvature versions applied to the persistent homology of networks.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Comparative analysis of Forman-Ricci curvature versions applied to the persistent homology of networks

Reference 67

Resolution: verified exact; local_arxiv, observed 2026-08-07T05:20:38.558139Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation bcc6733b-df33-4dca-879a-55c777981812 · outbound

This paper cites Liu, and Aaron Sidford.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Liu, and Aaron Sidford

Reference 68

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:38.182873Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 17727284-e9f4-4269-93fb-d3974367220d · outbound

This paper cites Discrete surface Ricci flow: Theory and applications.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Discrete surface Ricci flow: Theory and applications

Reference 69

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:38.186025Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c3272c8c-7932-43cf-a565-26361b3dfc5b · outbound

This paper cites Graph structure learning for robust graph neural networks.Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pages 66–74, 2020.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Graph structure learning for robust graph neural networks.Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pages 66–74, 2020

Reference 70

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:38.188947Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ef2d81df-7741-4abe-a30e-bd52c13b173a · outbound

This paper cites Graph con- densation for graph neural networks.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Graph con- densation for graph neural networks

Reference 71

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:38.191747Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5ea55b0c-6136-4620-8696-be0f5989c8d1 · outbound

This paper cites Characterizations of Forman curvature.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Characterizations of Forman curvature

Reference 72

Resolution: verified exact; local_arxiv, observed 2026-08-07T05:20:38.545063Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation c8a0ea6c-8218-4ca3-b929-bd9e5492282a · outbound

This paper cites Towards tight bounds for spectral sparsification of hypergraphs.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Towards tight bounds for spectral sparsification of hypergraphs

Reference 73

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:38.198014Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 71c711e1-0319-4683-85de-a1bf82217541 · outbound

This paper cites A hypergraph partitioning package.Army HPC Research Center, Department of Computer Science & Engineering, University of Minnesota, 2:1–20, 1998.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey A hypergraph partitioning package.Army HPC Research Center, Department of Computer Science & Engineering, University of Minnesota, 2:1–20, 1998

Reference 74

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:38.200632Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6f294599-fc03-44af-b8fb-7a53b2e44322 · outbound

This paper cites Sharathkumar.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Sharathkumar

Reference 75

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:38.203758Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 16a81104-8948-4938-89e9-fa5c7807443c · outbound

This paper cites Link pruning for community detection in social networks.Applied Sciences, 12(13):6811, 2022.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Link pruning for community detection in social networks.Applied Sciences, 12(13):6811, 2022

Reference 76

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:38.206828Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d8428158-7065-470b-83c6-16b83047db87 · outbound

This paper cites Klein and Milan Randic.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Klein and Milan Randic

Reference 77

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:38.209906Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cd86a5fc-b1e1-402d-99f8-e11554bd545e · outbound

This paper cites A simple hypergraph min cut algorithm.Freie Universit¨at Berlin, Fachbereich Mathematik und Informatik; Serie B, Informatik, 1996.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey A simple hypergraph min cut algorithm.Freie Universit¨at Berlin, Fachbereich Mathematik und Informatik; Serie B, Informatik, 1996

Reference 78

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:38.212674Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation edf0b31e-983e-4517-8f45-be7a0412c299 · outbound

This paper cites Sketching cuts in graphs and hypergraphs.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Sketching cuts in graphs and hypergraphs

Reference 79

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:38.215622Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 804d7f74-a24a-408d-bd1c-a15831063e9e · outbound

This paper cites k-core: Theories and applications.Physics Reports, 832:1–32, 2019.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey k-core: Theories and applications.Physics Reports, 832:1–32, 2019

Reference 80

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:38.218634Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d02c2bc9-dd19-447b-812e-50e95069b37b · outbound

This paper cites Using persistent homology and dynamical distances to analyze protein binding.Statistical Applications in Genetics and Molecular Biology, 15(1), January 2016.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Using persistent homology and dynamical distances to analyze protein binding.Statistical Applications in Genetics and Molecular Biology, 15(1), January 2016

Reference 81

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:38.222199Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1e1e36f6-8df4-4628-8469-4292c4449cb8 · outbound

This paper cites Ricci curvature of random and empirical directed hypernetworks.Applied network science, 5:1–14, 2020.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Ricci curvature of random and empirical directed hypernetworks.Applied network science, 5:1–14, 2020

Reference 82

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:38.225060Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 53e7dec9-6d0a-42cd-8996-dde7033fdffd · outbound

This paper cites Stadler, and J¨ urgen Jost.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Stadler, and J¨ urgen Jost

Reference 83

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:38.228020Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0a16dad6-d124-49e0-b861-5cbdb5633296 · outbound

This paper cites Kahng, Y.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Kahng, Y

Reference 84

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:38.231045Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0fa6f6ea-4e2d-4d47-96ef-4e67ce25e168 · outbound

This paper cites an unresolved cited work.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Unresolved cited work

Reference 85

Resolution: unresolved; raw_fallback, observed 2026-08-07T05:20:39.559653Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 56e04752-2856-46e2-8474-13c9a75db8b9 · outbound

This paper cites an unresolved cited work.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Unresolved cited work

Reference 86

Resolution: unresolved; raw_fallback, observed 2026-08-07T05:20:39.542321Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation f5597f7a-e923-4fd9-bab0-7d91d941ccba · outbound

This paper cites Percolation on complex networks: Theory and application.Physics Reports, 907:1–68, 2021.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Percolation on complex networks: Theory and application.Physics Reports, 907:1–68, 2021

Reference 87

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:20:39.531316Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 3f0c9bf5-93ec-4dec-a07b-e6d0176e752a · outbound

This paper cites Submodular hypergraphs: p-Laplacians, Cheeger inequalities and spectral clustering.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Submodular hypergraphs: p-Laplacians, Cheeger inequalities and spectral clustering

Reference 88

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:20:39.518512Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 89dadbdd-0b67-4f64-845f-86cd45e14a6c · outbound

This paper cites Ricci curvature of graphs.Tohoku Mathematical Journal, 63(4):605 – 627, 2011.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Ricci curvature of graphs.Tohoku Mathematical Journal, 63(4):605 – 627, 2011

Reference 89

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:20:39.506085Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 1ca9f4b1-a024-4ae9-9491-65367779e4e0 · outbound

This paper cites Graph summarization methods and applications: A survey.ACM Computing Surveys, 51(3):1–34, 2018.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Graph summarization methods and applications: A survey.ACM Computing Surveys, 51(3):1–34, 2018

Reference 90

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:20:39.494297Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 4174f3e2-9ee2-4d0e-ab01-0aaa91369736 · outbound

This paper cites Ricci curvature for metric-measure spaces via optimal transport.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Ricci curvature for metric-measure spaces via optimal transport

Reference 91

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:20:39.483259Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 60d38123-bb9b-4355-b7c8-6350270733bd · outbound

This paper cites Hypergraph Markov operators, eigenvalues and approximation algorithms.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Hypergraph Markov operators, eigenvalues and approximation algorithms

Reference 92

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:20:39.472421Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 84b6d819-5feb-42c8-975d-5082fb4a4f5d · outbound

This paper cites A fast hypergraph min-cut algorithm for circuit partitioning.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey A fast hypergraph min-cut algorithm for circuit partitioning

Reference 93

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:20:39.461728Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 32621648-3fca-45e5-b024-f426375bc778 · outbound

This paper cites A random walks view of spectral segmentation.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey A random walks view of spectral segmentation

Reference 94

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:20:39.450780Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 13dce879-5b2d-4a74-89be-c511a9b87701 · outbound

This paper cites Quantitative simplification of filtered simplicial complexes.Discrete & Computational Geometry, 65(2):554–583, 2021.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Quantitative simplification of filtered simplicial complexes.Discrete & Computational Geometry, 65(2):554–583, 2021

Reference 95

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:20:39.439773Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 3a596255-7eb0-4c93-b4f6-da9785ece41a · outbound

This paper cites Laplacian matrices of graphs: A survey.Linear Algebra and its Applications, 197–198:143–176, 1994.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Laplacian matrices of graphs: A survey.Linear Algebra and its Applications, 197–198:143–176, 1994

Reference 96

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:20:39.428544Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation f35df736-04af-420c-86f1-1c014119e5e3 · outbound

This paper cites Manifolds with density.Notices of the AMS, 52(8):853–858, 2005.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Manifolds with density.Notices of the AMS, 52(8):853–858, 2005

Reference 97

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:20:39.416762Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 6b2e735e-1e6c-490d-90cb-6fc47151199e · outbound

This paper cites Wojciechowski.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Wojciechowski

Reference 98

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:20:39.404643Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation c983a7ee-4508-4da6-b112-9cc814dd262c · outbound

This paper cites A linear-time algorithm for finding a sparse k-connected spanning subgraph ofak-connected graph.Algorithmica, 7(1):583–596, 1992.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey A linear-time algorithm for finding a sparse k-connected spanning subgraph ofak-connected graph.Algorithmica, 7(1):583–596, 1992

Reference 99

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T05:20:39.393036Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation f2aae4d6-c817-4207-a77d-341797c8fce4 · outbound

This paper cites Oxford University Press, 2018.

Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey Oxford University Press, 2018

Reference 100

Resolution: unresolved; no resolver link, observed 2026-08-07T05:20:38.285144Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Coverage vector

Reference resolution

Outbound references

Pith citing papers