Results 71 to 80 of about 47,591 (350)

Evaluating the Effects of the Clique Selection in Exact Graph Coloring Algorithms

, 2011
It is a common practice in exact enumerative algorithms for graph colouring to find a clique of maximum cardinality and to fix the colours of this subgraph before proceeding with implicit enumeration on the remainder of the graph.
International Journal O. F. Operational Research, I. N. Exact Graph Coloring Algorithms Evaluating The Effects Of The Clique Selection, P. Dellolmo, M. Caramia, DELL'OLMO, Paolo   +4 more
core   +1 more source

Infinitely many minimal classes of graphs of unbounded clique-width [PDF]

, 2017
The celebrated theorem of Robertson and Seymour states that in the family of minor-closed graph classes, there is a unique minimal class of graphs of unbounded tree-width, namely, the class of planar graphs.
Zamaraev, V, V. Zamaraev, Lozin, Vadim V., A. Collins, Foniok, J., Foniok, Jan, Zamaraev, Victor, Collins, Andrew, Lozin, V, Zamaraev, Viktor, J. Foniok, Foniok, J, V. Lozin, Korpelainen, N, N. Korpelainen, Korpelainen, Nicholas, Lozin, Vadim, Collins, A., Collins, A   +18 more
core   +1 more source

Topology‐Aware Deep Learning on Higher‐Order Structures for Drug Response Prediction

Advanced Science, EarlyView.
We present TopDr, a topology‐aware deep learning framework that encodes both drugs and cell lines as multiscale simplicial complexes, capturing interactions at the 0‐, 1‐, and 2‐simplex levels. By jointly integrating local higher‐order neighborhoods and global topological structures, TopDr generates enriched representations for sensitivity prediction ...
Cong Shen, Guancen Lin, Chuan‐Shen Hu, Yong Wang   +3 more
wiley   +1 more source

A new graph construction of unbounded clique-width.

, 2016
We define permutation-partition graphs by replacing one part of a 2K2-free bipartite graph (a bipartite chain graph) by an induced linear forest. We show that this hereditary graph class is of of unbounded clique-width (with a new graph construction of ...
Korpelainen, Nicholas
core   +1 more source

Interpretability and Representability of Commutative Algebra, Algebraic Topology, and Topological Spectral Theory for Real‐World Data

Advanced Intelligent Discovery, EarlyView.
This article investigates how persistent homology, persistent Laplacians, and persistent commutative algebra reveal complementary geometric, topological, and algebraic invariants or signatures of real‐world data. By analyzing shapes, synthetic complexes, fullerenes, and biomolecules, the article shows how these mathematical frameworks enhance ...
Yiming Ren, Guo‐Wei Wei
wiley   +1 more source

ANALISIS JARINGAN KOMUNIKASI RISIKO PETANI BAWANG MERAH: STUDI KASUS KELOMPOK TANI RINDU ALAM DESA CIKAWAO, PROVINSI JAWA BARAT

Jurnal Agrisep, 2018
Risk perceptions needs to be developed through risk communication. Without it, farmers' awareness risks is low. The paper is aimed to explain risk communication in Rindu Alam Farmer Group using Social Network Analysis (SNA) Method.
Raesa Harlina, Sri Fatimah, Iwan Setiawan   +2 more
doaj   +1 more source

Auxiliary-Function-Based Independent Vector Analysis Using Generalized Inter-Clique Dependence Source Models With Clique Variance Estimation

IEEE Access, 2020
By introducing a frequency dependence source prior including full-band and clique models, independent vector analysis (IVA) has been successfully used for convolutive blind source separation (BSS). In addition, independent low-rank matrix analysis (ILRMA)
Ui-Hyeop Shin, Hyung-Min Park
doaj   +1 more source

A new species of Lonchidiidae (Hybodontiformes) from the Late Jurassic of Brazil (Aliança Formation, Jatobá Basin)

The Anatomical Record, EarlyView.
Abstract The Aliança Formation (Jatobá Basin) represents lacustrine deposits formed in oxygenated waters that hosted a diverse fauna, including Hybodontiform sharks. Within this group, the Family Lonchidiidae comprises 11 valid genera, with Parvodus previously reported in Brazilian deposits from the Brejo Santo Formation (Araripe Basin, Late Jurassic ...
Larissa de Souza Ribeiro, Marco Aurélio Gallo de França   +1 more
wiley   +1 more source

Exploring Clique Transversal Variants on Distance-Hereditary Graphs: Computational Insights and Algorithmic Approaches

Algorithms
The clique transversal problem is a critical concept in graph theory, focused on identifying a minimum subset of vertices that intersects all maximal cliques in a graph. This problem and its variations—such as the k-fold clique, {k}-clique, minus clique,
Chuan-Min Lee
doaj   +1 more source

Adaptive Image Restoration and Segmentation Method Using Different Neighborhood Sizes [PDF]

Journal of Systemics, Cybernetics and Informatics, 2003
The image restoration methods based on the Bayesian's framework and Markov random fields (MRF) have been widely used in the image-processing field. The basic idea of all these methods is to use calculus of variation and mathematical statistics to average
Chengcheng Li, William J. B. Oldham
doaj