Results 41 to 50 of about 9,811 (181)

DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping

Computer Graphics Forum, EarlyView.
Abstract An algorithm for cutting solid objects in a topology‐controlled manner is presented. Concretely, given a loop on the object boundary, a disk‐topology cut surface bounded by the loop is constructed in the interior. In contrast to various previous approaches, both disk topology and conformance to the prescribed loop are ensured by construction ...
S. Hinderink, M. Campen
wiley   +1 more source

A Lexicographic Product Cancellation Property for Digraphs [PDF]

, 2012
There are four prominent product graphs in graph theory: Cartesian, strong, direct, and lexicographic. Of these four product graphs, the lexicographic product graph is the least studied.
Manion, Kendall
core   +1 more source

DOMINATION ON LEXICOGRAPHICAL PRODUCT OF COMPLETE GRAPHS [PDF]

International Journal of Pure and Apllied Mathematics, 2013
Let (G) and ' (G) be the domination number and edge dom- ination number, respectively. The lexicographical Product G1 • G2 of graph of G1 and G2 has vertex set V (G1 • G2) = V (G1) × V (G2) and edge set E(G1 •G2) = {(u1v1)(u2v2)| (u1u2 ∈ E(G1))∪(u1 = u2 and v1v2 ∈ E(G2))}.
openaire   +1 more source

An iterated greedy‐based metaheuristic with local search for the rank pricing problem

International Transactions in Operational Research, EarlyView.
Abstract The rank pricing problem involves determining optimal prices for a set of products while accounting for customers' budgets and preferences. This study develops an iterated greedy‐based metaheuristic to efficiently solve this problem. The core idea is to generate a sequence of solutions by iteratively applying destruction and reconstruction ...
Herminia I. Calvete, Carmen Galé, Aitor Hernández, José A. Iranzo   +3 more
wiley   +1 more source

The Well-Covered Dimension Of Products Of Graphs

Discussiones Mathematicae Graph Theory, 2014
We discuss how to find the well-covered dimension of a graph that is the Cartesian product of paths, cycles, complete graphs, and other simple graphs. Also, a bound for the well-covered dimension of Kn × G is found, provided that G has a largest greedy ...
Birnbaum Isaac, Kuneli Megan, McDonald Robyn, Urabe Katherine, Vega Oscar   +4 more
doaj   +1 more source

Orientable -distance magic regular graphs

AKCE International Journal of Graphs and Combinatorics, 2021
Hefetz, Mütze, and Schwartz conjectured that every connected undirected graph admits an antimagic orientation (Hefetz et al., 2010). In this paper we support the analogous question for distance magic labeling. Let be an Abelian group of order .
Paweł Dyrlaga, Karolina Szopa
doaj   +1 more source

The team orienteering problem with variable time windows

International Transactions in Operational Research, Volume 33, Issue 3, Page 1705-1732, May 2026.
Abstract The orienteering problem is well‐established within the domain of operational research. This paper introduces the team orienteering problem with variable time windows (TOPVTW) as a new variant of the team orienteering problem with time windows. The distinguishing feature of the TOPVTW is the adaptive time windows, which evolve dynamically as a
Bibiana Granda, Begoña Vitoriano
wiley   +1 more source

Ramified rectilinear polygons: coordinatization by dendrons

, 2010
Simple rectilinear polygons (i.e. rectilinear polygons without holes or cutpoints) can be regarded as finite rectangular cell complexes coordinatized by two finite dendrons.
A Dress, D Eppstein, D Eppstein, D Eppstein, D Harel, David Eppstein, DJ Rose, G Birkhoff, G Sabidussi, H-J Bandelt, H-J Bandelt, H-J Bandelt, H-J Bandelt, H-J Bandelt, Hans-Jürgen Bandelt, HM Mulder, JHC Whitehead, JR Isbell, JSB Mitchell, K Menger, LM Blumenthal, M Bridson, M de Berg, M van de Vel, M van de Vel, R Frucht, R Hammack, RL Graham, S Alstrup, S Klavžar, SP Avann, V Chepoi, Victor Chepoi, W Imrich   +33 more
core   +3 more sources

Modeling and generating user‐centered contrastive explanations for the workforce scheduling and routing problem

International Transactions in Operational Research, Volume 33, Issue 3, Page 1525-1558, May 2026.
Abstract In the last decade, explainability has been attracting much attention in the machine learning community. However, this research topic extends beyond this field to encompass others such as operations research and combinatorial optimization (CO).
Mathieu Lerouge, Céline Gicquel, Vincent Mousseau, Wassila Ouerdane   +3 more
wiley   +1 more source

The irregularity of graphs under graph operations

Discussiones Mathematicae Graph Theory, 2014
The irregularity of a simple undirected graph G was defined by Albertson [5] as irr(G) = ∑uv∈E(G) |dG(u) − dG(v)|, where dG(u) denotes the degree of a vertex u ∈ V (G).
Abdo Hosam, Dimitrov Darko
doaj   +1 more source