Results 31 to 40 of about 5,334 (178)

Strong chromatic index and Hadwiger number

open access: yes, 2022
International audienceWe investigate the effect of a fixed forbidden clique minor upon the strong chromatic index, both in multigraphs and in simple graphs.
Kang, R.J.   +11 more
core   +1 more source

Language and Education in Brazil: Linguistic Structural Problems and Their Historical Origins

open access: yesModern Languages Open, 2022
In this article I offer an extended socio-historical overview of the Portuguese language in Brazil from independence to modern times in order to establish why there is such a gulf between the written official standard and actual linguistic usage.
Paul O'Neill
doaj   +1 more source

Chih-k'o and Sung Clique strifes [PDF]

open access: yes, 1956
In the chih-k'o or government service examination under Sung, which was held in the 3rd year of Hsi-ning (1070 A.D.), K'ung Wen-chung, who belonged to the opposition clique, severely criticised Wang An-shih's policy.
荒木, 敏一
core   +1 more source

Optimal Centrality Computations Within Bounded Clique-Width Graphs [PDF]

open access: yes, 2021
Given an n-vertex m-edge graph G of clique-width at most k, and a corresponding k-expression, we present algorithms for computing some well-known centrality indices (eccentricity and closeness) that run in O(2^{O(k)}(n+m)^{1+ε}) time for any ε > 0. Doing
Ducoffe, Guillaume
core   +1 more source

Presentation of the Special Issue

open access: yesJournal of Illicit Economies and Development, 2019
The special issue of the Journal of Illicit Economies and Development presents various aspects of illicit markets in Brazil, their connections with legal activities and the institutional responses.
Luiz Guilherme Mendes de Paiva   +2 more
doaj   +1 more source

Hypergraphs with infinitely many extremal constructions

open access: yesDiscrete Analysis, 2023
Hypergraphs with infinitely many extremal constructions, Discrete Analysis 2023:18, 34 pp. A fundamental result in extremal graph theory, Turán's theorem, states that the maximal number of edges of a graph with $n$ vertices that does not contain a ...
Jianfeng Hou   +4 more
doaj   +1 more source

The strong clique number of graphs with forbidden cycles

open access: yes, 2020
15 pages, 7 ...
Cho, Eun-Kyung   +3 more
openaire   +2 more sources

Adaptive graph-theoretic localization of radiation sources via real-time density-aware clustering for IoT

open access: yesFrontiers in Computer Science
The increasing complexity of Internet of Things and modern battlefield electromagnetic environments poses significant challenges to radiation source localization, especially under electronic countermeasures, cross-density distributions, and iterative ...
Wei Chen   +4 more
doaj   +1 more source

What if CLIQUE were fast? Maximum Cliques in Information Networks and Strong Components in Temporal Networks

open access: yesCoRR, 2012
Exact maximum clique finders have progressed to the point where we can investigate cliques in million-node social and information networks, as well as find strongly connected components in temporal networks. We use one such finder to study a large collection of modern networks emanating from biological, social, and technological domains.
Ryan A. Rossi   +3 more
openaire   +2 more sources

Network‐assisted protein identification and data interpretation in shotgun proteomics

open access: yesMolecular Systems Biology, 2009
Protein assembly and biological interpretation of the assembled protein lists are critical steps in shotgun proteomics data analysis. Although most biological functions arise from interactions among proteins, current protein assembly pipelines treat ...
Jing Li   +5 more
doaj   +1 more source

Home - About - Disclaimer - Privacy