Results 141 to 150 of about 59,275 (246)
Precedence‐Constrained Shortest Path
Networks, Volume 86, Issue 3, Page 282-295, October 2025.ABSTRACT We propose a variant of the shortest path problem where the order in which vertices occur in the path is subject to precedence constraints. Precedence constraints are defined in terms of vertex pairs (a,b)$$ \left(a,b\right) $$ which indicate that a vertex a$$ a $$ is the predecessor of a vertex b$$ b $$.
Christina Büsing +2 more
wiley +1 more source
An Implicit Enumeration Approach for Maximum Ratio Clique Relaxations
Networks, Volume 86, Issue 3, Page 241-262, October 2025.ABSTRACT This article proposes an implicit enumeration approach to solve the maximum ratio s$$ s $$‐plex and the maximum ratio s$$ s $$‐defective clique problems. The approach is inspired by the classical Bron‐Kerbosch algorithm for enumerating all maximal cliques in a graph, which is extended to enumerating structures that are hereditary on induced ...
Yehor Blokhin +4 more
wiley +1 more source
The circular chromatic number of induced subgraphs
Journal of Combinatorial Theory, Series B, 2004 For positive integers \(d\) and \(k\), \(k\geq 2d\), a \((k, d)\)-coloring of a graph \(G\) is a mapping \(f: V(G) \rightarrow \{0, \dots, k-1\}\) such that, for every adjacent vertices \(x, y\) of \(G\), \(d\leq | f(x) - f(y)| \leq k - d\).
openaire +3 more sources
Sensitivity of Perron and Fiedler Eigenpairs to Structural Perturbations of a Network
Numerical Linear Algebra with Applications, Volume 32, Issue 5, October 2025.ABSTRACT One can estimate the change of the Perron and Fiedler values for a connected network when the weight of an edge is perturbed by analyzing relevant entries of the Perron and Fiedler vectors. This is helpful for identifying edges whose weight perturbation causes the largest change in the Perron and Fiedler values.
Silvia Noschese, Lothar Reichel
wiley +1 more source
ICESat‐2 Coastal and Nearshore Bathymetry Product Algorithm Development
Earth and Space Science, Volume 12, Issue 10, October 2025.Abstract NASA's ICESat‐2 (Ice, Cloud and land Elevation Satellite‐2) satellite launched in 2018, carrying a single instrument, the Advanced Topographic Laser Altimeter System (ATLAS). The Level 1 science objectives of the mission focus primarily on the cryosphere, with specific interest in monitoring changes in polar ice sheets, glaciers and sea ice ...
Lori Magruder +5 more
wiley +1 more source
Graphs determined by their finite induced subgraphs
Journal of Combinatorial Theory, Series B, 1986 A graph is called absolutely ubiquitous if its vertex set is countably infinite, and it is determined up to isomorphism by the set of isomorphism types of its finite induced subgraphs. A classification is given of absolutely ubiquitous graphs.
openaire +4 more sources
Using Saliency for Semantic Image Abstractions in Robotic Painting
Computer Graphics Forum, Volume 44, Issue 7, October 2025.Abstract We present an adaptive, semantics‐based abstraction approach that balances aesthetic quality and structural coherence within the practical constraints of robotic painting. We apply panoptic segmentation with color‐based over‐segmentation to partition images into meaningful regions aligned with semantic objects, while providing flexible ...
Michael Stroh +6 more
wiley +1 more source
Tight bounds for intersection‐reverse sequences, edge‐ordered graphs, and applications
Journal of the London Mathematical Society, Volume 112, Issue 4, October 2025.Abstract In 2006, Marcus and Tardos proved that if A1,⋯,An$A^1,\dots,A^n$ are cyclic orders on some subsets of a set of n$n$ symbols such that the common elements of any two distinct orders Ai$A^i$ and Aj$A^j$ appear in reversed cyclic order in Ai$A^i$ and Aj$A^j$, then ∑i|Ai|=O(n3/2logn)$\sum _{i} |A^i|=O(n^{3/2}\log n)$.
Barnabás Janzer +3 more
wiley +1 more source
Prosoluble subgroups of the profinite completion of the fundamental group of compact 3‐manifolds
Journal of the London Mathematical Society, Volume 112, Issue 4, October 2025.Abstract We give a description of finitely generated prosoluble subgroups of the profinite completion of 3‐manifold groups and toral relatively hyperbolic virtually compact special groups.
Lucas C. Lopes, Pavel A. Zalesskii
wiley +1 more source