Results 71 to 80 of about 564 (166)

Listing all spanning trees in Halin graphs — sequential and Parallel view

, 2018
For a connected labeled graph [Formula: see text], a spanning tree [Formula: see text] is a connected and acyclic subgraph that spans all vertices of [Formula: see text].
P. Renjith, N. Sadagopan, K. Krishna Mohan Reddy   +2 more
core   +1 more source

Geographic Patterns in I2P Peer Selection: An Empirical Network Topology Analysis

Internet Technology Letters, Volume 9, Issue 4, July/August 2026.
ABSTRACT The Invisible Internet Project (I2P) routes data via encrypted, decentralized tunnels. Peer selection can significantly affect security and performance. This empirical study examines whether geographic location systematically influences I2P's routing topology.
Siddique Abubakr Muntaka, Jess Kropczynski, Jacques Bou Abdo, Murat Ozer   +3 more
wiley   +1 more source

R ( 5 , 5 ) ≤ 46

Journal of Graph Theory, Volume 112, Issue 3, Page 198-208, July 2026.
ABSTRACT We prove that the Ramsey number R ( 5 , 5 ) is less than or equal to 46. The proof uses a combination of linear programming and checking a large number of cases by computer. All of the computational parts of the proof were independently implemented by both authors, with consistent results.
Vigleik Angeltveit, Brendan D. McKay
wiley   +1 more source

Towards Characterization of Five‐List‐Colorability of Toroidal Graphs

Journal of Graph Theory, Volume 112, Issue 3, Page 267-275, July 2026.
ABSTRACT Through computer‐assisted enumeration, we list minimal obstructions for 5‐choosability of graphs on the torus with the following additional property: There exists a cyclic system of non‐contractible triangles around the torus where the consecutive triangles are at distance at most four.
Zdeněk Dvořák, Félix Moreno Peñarrubia   +1 more
wiley   +1 more source

Efficient algorithms for subgraph counting and enumeration on large graphs

This thesis delves into critical challenges associated with subgraph analysis in large-scale graphs. The proliferation of data in domains such as social networks, Internet applications, and biological networks necessitates a deep understanding of ...
Wang, Kaixin
core   +1 more source

Treewidth Versus Clique Number. V. Further Connections With Tree‐Independence Number

Journal of Graph Theory, Volume 112, Issue 3, Page 337-351, July 2026.
ABSTRACT We continue the study of ( tw , ω )‐bounded graph classes, that is, hereditary graph classes in which large treewidth is witnessed by the presence of a large clique, and the relation of this property to boundedness of the tree‐independence number, a graph parameter introduced independently by Yolov in 2018 and by Dallard, Milanič, and Štorgel ...
Claire Hilaire, Martin Milanič, Ðorđe Vasić   +2 more
wiley   +1 more source

Ordered Median Traveling Salesman Problem

Networks, Volume 88, Issue 1, Page 59-84, July 2026.
ABSTRACT This paper introduces a novel combinatorial optimization problem with ordering constraints, termed the Ordered Median Traveling Salesman Problem (OMTSP). The OMTSP integrates key elements from both the classic Traveling Salesman Problem (TSP) and the Ordered Median Location Problem.
Ivana Ljubić, Alfredo Marín, Justo Puerto, Francisco Temprano   +3 more
wiley   +1 more source

Sparse induced subgraphs in P_6-free graphs

, 2023
We prove that a number of computational problems that ask for the largest sparse induced subgraph satisfying some property definable in CMSO2 logic, most notably Feedback Vertex Set, are polynomial-time solvable in the class of $P_6$-free graphs.
Pilipczuk, Marcin, McCarty, Rose, Pilipczuk, Michał, Chudnovsky, Maria, Rzążewski, Paweł   +4 more
core  

Large Deviations of the Giant Component in Scale‐Free Inhomogeneous Random Graphs

Random Structures &Algorithms, Volume 68, Issue 4, July 2026.
ABSTRACT We study large deviations of the size of the largest connected component in a general class of inhomogeneous random graphs with iid weights, parametrized so that the degree distribution is regularly varying. We derive a large‐deviation principle with logarithmic speed: the rare event that the largest component contains linearly more vertices ...
Joost Jorritsma, Bert Zwart
wiley   +1 more source

Inter‐platform ecosystems

Strategic Management Journal, Volume 47, Issue 7, Page 1840-1877, July 2026.
Abstract Research Summary We extend ecosystem theory to cases in which platforms are complementors to each other: inter‐platform ecosystems. Analyzing web traffic data on 241 European platforms, we identify and characterize demand‐side inter‐platform ecosystems, and propose a theory of why they emerge.
Bruno Carballa‐Smichowski, Néstor Duch‐Brown, Bertin Martens, Álvaro Gomez‐Losada   +3 more
wiley   +1 more source