Results 181 to 190 of about 919,306 (297)

Optimal Designs for Discrete Choice Models Via Graph Laplacians. [PDF]

J Stat Theory Pract
Röttger F, Kahle T, Schwabe R.
europepmc   +1 more source

Characterizations and Algorithmic Applications of Chordal Graph Embeddings

Discrete Applied Mathematics, 1997
A. Parra, Petra Scheffler
semanticscholar   +1 more source

Clique tree generalization and new subclasses of chordal graphs

, 2002
Pankaj Kumar, C. E. Veni Madhavan
openalex   +1 more source

Algebraic invariants of the edge ideals of whisker graphs of cubic circulant graphs. [PDF]

Heliyon
Afridi MUK, Rehman IU, Ishaq M.
europepmc   +1 more source

Generating and characterizing the perfect elimination orderings of a chordal graph

Theoretical Computer Science, 2003
L. Chandran, L. Ibarra, F. Ruskey, J. Sawada   +3 more
semanticscholar   +1 more source

High‐speed railway track geometry robust maintenance with Bayesian deep learning‐enhanced physical‐informed neural networks

Computer-Aided Civil and Infrastructure Engineering, Volume 40, Issue 24, Page 3934-3952, 6 October 2025.
Abstract Millimeter‐level active control of track geometry irregularity (TGI) is crucial for intelligent maintenance of high‐speed railways. To address the efficiency limitations of existing time‐domain characteristics‐dominated TGI maintenance scheme design methods and vehicle–track coupled dynamics evaluation models, this paper proposes a new ...
Huakun Sun, Yan Gao, Congyang Xu, Wenhao Ding, Fei Yang, Ping Wang, Qing He   +6 more
wiley   +1 more source

Counting Temporal Paths. [PDF]

Algorithmica
Enright J, Meeks K, Molter H.
europepmc   +1 more source

On chordal graphs and their chromatic polynomials

, 2003
Geir Agnarsson
openalex   +2 more sources

On extremal problems associated with random chords on a circle

Mathematika, Volume 71, Issue 4, October 2025.
Abstract Inspired by the work of Karamata, we consider an extremization problem associated with the probability of intersecting two random chords inside a circle of radius r,r∈(0,1]$r, \, r \in (0,1]$, where the endpoints of the chords are drawn according to a given probability distribution on S1$\mathbb {S}^1$.
Cynthia Bortolotto, João P. G. Ramos
wiley   +1 more source

Orthology and near-cographs in the context of phylogenetic networks. [PDF]

Algorithms Mol Biol
Lindeberg A, Scholz GE, Wieseke N, Hellmuth M.   +3 more
europepmc   +1 more source