Results 61 to 70 of about 996,556 (196)
A Novel Defect Tolerance Scheme for Nanocrossbar Architectures with Enhanced Efficiency
Micromachines, 2018 The semiconductor industry is now facing challenges to keep pace with Moore’s law and this leads to the requirement of new materials and newer technological devices. Molecular switch-based nanodevices are one of the promising areas because of their
Devisree Sasikumar, Anand Kumar
doaj +1 more source
Independent Transversal Total Domination Versus Total Domination in Trees
Discussiones Mathematicae Graph Theory, 2021 A subset of vertices in a graph G is a total dominating set if every vertex in G is adjacent to at least one vertex in this subset. The total domination number of G is the minimum cardinality of any total dominating set in G and is denoted by γt(G).
Martínez Abel Cabrera +2 more
doaj +1 more source
Applied SciencesLarge Language Models (LLMs) have shown a strong performance across various tasks but still face challenges in automatic text summarization. While they are effective in capturing semantic patterns from large corpora, they typically lack mechanisms for ...
Cengiz Hark
doaj +1 more source
On Independent [1, 2]-sets in Hypercubes [PDF]
ITM Web of ConferencesGiven a simple graph G, a subset S ⊆ V(G) is an independent [1, 2]-set if no two vertices in S are adjacent and for every vertex υ ϵ V(G)\S, 1 ≤ |N(υ) ∩ S | ≤ 2, that is, every vertex υ ϵ V(G)\S is adjacent to at least one but not more than two vertices ...
Santoso Eko Budi +2 more
doaj +1 more source
Multiobject tracking as maximum weight independent set [PDF]
CVPR 2011, 2011 This paper addresses the problem of simultaneous tracking of multiple targets in a video. We first apply object detectors to every video frame. Pairs of detection responses from every two consecutive frames are then used to build a graph of tracklets.
William Brendel +2 more
openaire +1 more source
Faster approximation for maximum independent set on unit disk graph
, 2017 Maximum independent set from a given set D of unit disks intersecting a horizontal line can be solved in O(n2) time and O(n2) space. As a corollary, we design a factor 2 approximation algorithm for the maximum independent set problem on unit disk graph ...
Sasanka Roy +5 more
core +1 more source
Minimum Connected Dominating Set Algorithms for Ad Hoc Sensor Networks
Sensors, 2019 To achieve effective communication in ad hoc sensor networks, researchers have been working on finding a minimum connected dominating set (MCDS) as a virtual backbone network in practice.
Xuemei Sun, Yongxin Yang, Maode Ma
doaj +1 more source
Structure of conflict graphs in constraint alignment problems and algorithms [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 We consider the constrained graph alignment problem which has applications in biological network analysis. Given two input graphs $G_1=(V_1,E_1), G_2=(V_2,E_2)$, a pair of vertex mappings induces an {\it edge conservation} if the vertex pairs are ...
Ferhat Alkan +3 more
doaj +1 more source
Maximum weight cycle packing in directed graphs, with application to kidney exchange programs [PDF]
, 2009 Centralized matching programs have been established in several countries to organize kidney exchanges between incompatible patient-donor pairs. At the heart of these programs are algorithms to solve kidney exchange problems, which can be modelled as ...
Biro, P., Rizzi, R., Manlove, D.F.
core +1 more source
Robust maximum weighted independent-set problems on interval graphs [PDF]
, 2011 We study the maximum weighted independent-set problem on interval graphs with uncertainty on the vertex weights. We use the absolute robustness criterion and the min-max regret criterion to evaluate solutions.
Leus, Roel, Talla Nobibon, Fabrice
core +1 more source