Výsledky vyhledávání - "Basu, Sabyasachi"

Report

Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets

Autor: Basu, Sabyasachi, Paul-Pena, Daniel, Qian, Kun, Seshadhri, C., Huang, Edward W, Subbian, Karthik

Graphs are a fundamental data structure used to represent relationships in domains as diverse as the social sciences, bioinformatics, cybersecurity, the Internet, and more. One of the central observations in network science is that real-world graphs

Externí odkaz: http://arxiv.org/abs/2407.16850

Zobrazit plný text záznamu

Report

A Sublinear Algorithm for Approximate Shortest Paths in Large Networks

Autor: Basu, Sabyasachi, Kōshima, Nadia, Eden, Talya, Ben-Eliezer, Omri, Seshadhri, C.

Computing distances and finding shortest paths in massive real-world networks is a fundamental algorithmic task in network analysis. There are two main approaches to solving this task. On one hand are traversal-based algorithms like bidirectional bre

Externí odkaz: http://arxiv.org/abs/2406.08624

Zobrazit plný text záznamu

Report

Optimal storage codes on graphs with fixed locality

Autor: Basu, Sabyasachi, Mukherjee, Manuj

Storage codes on graphs are an instance of \emph{codes with locality}, which are used in distributed storage schemes to provide local repairability. Specifically, the nodes of the graph correspond to storage servers, and the neighbourhood of each ser

Externí odkaz: http://arxiv.org/abs/2307.08680

Zobrazit plný text záznamu

Report

Spectral Triadic Decompositions of Real-World Networks

Autor: Basu, Sabyasachi, Bera, Suman Kalyan, Seshadhri, C.

A fundamental problem in mathematics and network analysis is to find conditions under which a graph can be partitioned into smaller pieces. The most important tool for this partitioning is the Fiedler vector or discrete Cheeger inequality. These resu

Externí odkaz: http://arxiv.org/abs/2211.06352

Zobrazit plný text záznamu

Report

The complexity of testing all properties of planar graphs, and the role of isomorphism

Autor: Basu, Sabyasachi, Kumar, Akash, Seshadhri, C.

Publikováno v: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1702-1714

Consider property testing on bounded degree graphs and let $\varepsilon>0$ denote the proximity parameter. A remarkable theorem of Newman-Sohler (SICOMP 2013) asserts that all properties of planar graphs (more generally hyperfinite) are testable with

Externí odkaz: http://arxiv.org/abs/2108.10547

Zobrazit plný text záznamu

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Analysis of first-order spatial bilateral ARMA models

Autor: Basu, Sabyasachi.

Thesis (Ph. D.)--University of Wisconsin--Madison, 1990.
Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves: 143-149).

Externí odkaz: http://catalog.hathitrust.org/api/volumes/oclc/23164299.html

Zobrazit plný text záznamu