Results 111 to 120 of about 63,637 (247)

Fluidly Revealing Information: A Survey of Un/foldable Data Visualizations

Computer Graphics Forum, EarlyView.
Abstract Revealing relevant information on demand is an essential requirement for visual data exploration. In this state‐of‐the‐art report, we review and classify techniques that are inspired by the physical metaphor of un/folding to reveal relevant information or, conversely, to reduce irrelevant information in data visualizations.
M.‐J. Bludau, M. Dörk, S. Bruckner, C. Tominski   +3 more
wiley   +1 more source

A new family of solutions for graph‐restricted cooperative games: rethinking the weight of intermediary power

International Transactions in Operational Research, EarlyView.
Abstract In graph‐restricted cooperative games, a group of agents, represented by the nodes of a graph, work together to make a profit. However, two agents can cooperate within a coalition only if they are connected by the graph in the coalition. Several allocation rules have been proposed for these games, but there is something in common in all of ...
Antonio C. Alarcón, José M. Gallardo, Andrés Jiménez‐Losada   +2 more
wiley   +1 more source

Apex Graphs and Cographs

Theory and Applications of Graphs
A class G of graphs is called hereditary if it is closed under taking induced subgraphs. We denote by G^{apex} the class of graphs G that contain a vertex v such that G − v is in G.
Jagdeep Singh, Vaidy Sivaraman, Thomas Zaslavsky   +2 more
doaj   +1 more source

Assigning airport ground handling operations: a data‐driven matheuristic

International Transactions in Operational Research, EarlyView.
Abstract In this paper, we study a problem in the crossover between vehicle routing and scheduling problems. The multi‐trip capacitated vehicle routing and scheduling problem with time windows and meal breaks is extended to a heterogeneous fleet of trucks and drivers, with qualifications and different loading patterns.
Alexandre Dupaquis, Ronan Guivarch, Sandrine Mouysset, Daniel Ruiz, Vincent Charvillat, Frédéric Bouilhaguet   +5 more
wiley   +1 more source

Noncompact surfaces, triangulations and rigidity

Bulletin of the London Mathematical Society, EarlyView.
Abstract Every noncompact surface is shown to have a (3,6)‐tight triangulation, and applications are given to the generic rigidity of countable bar‐joint frameworks in R3${\mathbb {R}}^3$. In particular, every noncompact surface has a (3,6)‐tight triangulation that is minimally 3‐rigid. A simplification of Richards' proof of Kerékjártó's classification
Stephen C. Power
wiley   +1 more source

Characterizing the forbidden pairs for graphs to be super-edge-connected

AKCE International Journal of Graphs and Combinatorics
Let [Formula: see text] be a set of given connected graphs. A graph G is said to be [Formula: see text]-free if G contains no H as an induced subgraph for any [Formula: see text].
Hazhe Ye, Yingzhi Tian
doaj   +1 more source

The largest subgraph without a forbidden induced subgraph

20 ...
Fox, Jacob, Nenadov, Rajko, Pham, Huy Tuan   +2 more
openaire   +2 more sources

Presentation of kernels of rational characters of right‐angled Artin groups

Bulletin of the London Mathematical Society, EarlyView.
Abstract In this note, we characterise when the kernel of a rational character of a right‐angled Artin group, also known as generalised Bestiva–Brady group, is finitely generated and finitely presented. In these cases, we exhibit a finite generating set and a presentation.
Montserrat Casals‐Ruiz, Ilya Kazachkov, Mallika Roy   +2 more
wiley   +1 more source

The multidepot drone general routing problem with duration and capacity constraints

International Transactions in Operational Research, Volume 32, Issue 6, Page 3756-3779, November 2025.
Abstract This paper studies the multidepot drone general routing problem with duration and capacity constraints (MDdGRP), an extension of the classical general routing problem with several depots. A fleet of drones with limited flight time and payload, each one located in a different depot, must jointly perform the service.
Teresa Corberán, Isaac Plana, José M. Sanchis, Paula Segura   +3 more
wiley   +1 more source

Search Result Clustering via Randomized Partitioning of Query-Induced Subgraphs [PDF]

Telfor Journal, 2009
In this paper, we present an approach to search result clustering, using partitioning of underlying link graph. We define the notion of "query-induced subgraph" and formulate the problem of search result clustering as a problem of efficient partitioning ...
A. Bradic
doaj