Results 81 to 90 of about 68,433 (283)
Turnier und Geschlecht. Studien zu Kampfspielen im Römisch-Deutschen Reich im 15. Jahrhundert
L'Atelier du CRH, 2023 Constanze Buyken
doaj +1 more source
Journal of Graph TheoryABSTRACTAn inversion of a tournament is obtained by reversing the direction of all edges with both endpoints in some set of vertices. Let be the minimum length of a sequence of inversions using sets of size at most that result in the transitive tournament. Let be the maximum of taken over ‐vertex tournaments.
openaire +3 more sources
Two‐Block Paths in Oriented Graphs of Large Semidegree
Journal of Graph Theory, EarlyView.ABSTRACT We study the existence of oriented paths with two blocks in oriented graphs under semidegree conditions. A block of an oriented path is a maximal directed subpath. Given positive integers k $k$ and ℓ $\ell $ with k / 2 ≤ ℓ < k $k/2\le \ell \lt k$, we establish a semidegree function that guarantees the containment of every oriented path with ...
Irena Penev +4 more
wiley +1 more source
Computing Tournament Solutions using Relation Algebra and REL VIEW [PDF]
We describe a simple computing technique for the tournament choice problem. It rests upon a relational modeling and uses the BDD-based computer system RelView for the evaluation of the relation-algebraic expressions that specify the solutions and for the
Rudolf Berghammer +2 more
core
Journal of Graph Theory, EarlyView.ABSTRACT A 2‐edge‐coloured graph G $G$ is called locally complete if for each vertex v $v$, the vertices adjacent to v $v$ through edges of the same colour induce a complete subgraph in G $G$. Locally complete 2‐edge‐coloured graphs have nice properties, and there exists a polynomial algorithm to decide whether such a graph has an alternating ...
Jørgen Bang‐Jensen, Jing Huang
wiley +1 more source
Cavalerul în turnir, temă iconografică redată pe cahle medievale din Muntenia
Cercetări ArheologiceThe stove tiles from the 15th and 16th centuries discovered in some countries in Central Europe often approach, as decoration, the theme of the medieval knight. The archaeological research carried out on the territory of Romania brought to light a vast
Maria–Venera Rădulescu
doaj +1 more source
Discrete Mathematics, 2003 Suppose \(n\) teams participate in a round-robin tournament. Each team consists of \(p\) players and when two teams meet each member of each team plays against each member of the other team once; there are no draws. The author determines, for any given \(k\), the maximum number \(w\) of wins that can be achieved by each of \(k\) players.
openaire +1 more source
Materials Genome Engineering Advances, EarlyView.An improved genetic algorithm is developed to automatically optimize prompts for materials literature information extraction. For corrosion‑inhibitor papers, IGA‑POLLM framework achieves an F1 score of 0.857, outperforming expert‐crafted prompts and randomly sampled prompts.
Hengju Xiang +9 more
wiley +1 more source
A Remark on the Tournament Game
The Electronic Journal of Combinatorics, 2015 We study the Maker-Breaker tournament game played on the edge set of a given graph $G$. Two players, Maker and Breaker, claim unclaimed edges of $G$ in turns, while Maker additionally assigns orientations to the edges that she claims. If by the end of the game Maker claims all the edges of a pre-defined goal tournament, she wins the game.
Dennis Clemens, Mirjana Mikalacki
openaire +4 more sources
[News Clip: Baseball star in golf tournament]
, 1953 Video footage from the WBAP-TV television station in Fort Worth, Texas, to accompany a news story about Brooklyn Dodgers pitcher Don Newcombe playing golf at a Houston ...
WBAP-TV (Television station : Fort Worth, Tex.)
core