Results 21 to 30 of about 101,154 (305)
The complexity of combinatorial optimization problems on d‐dimensional boxes [PDF]
, 2007 The Maximum Independent Set problem in d-box graphs, i.e., in intersection graphs of axis-parallel rectangles in R-d, is known to be NP-hard for any fixed d >= 2.
Chlebikova, Janka +5 more
core +1 more source
Intersection problem for Droms RAAGs [PDF]
International Journal of Algebra and Computation, 2018 We solve the subgroup intersection problem (SIP) for any RAAG [Formula: see text] of Droms type (i.e. with defining graph not containing induced squares or paths of length [Formula: see text]): there is an algorithm which, given finite sets of generators for two subgroups [Formula: see text], decides whether [Formula: see text] is finitely generated ...
Jordi Delgado +2 more
openaire +5 more sources
All-Pairs Shortest Paths in Geometric Intersection Graphs
Journal of Computational Geometry, 2019 $\newcommand{\OO}[1]{O\left(#1\right)}$We present a simple and general algorithm for the all-pairs shortest paths (APSP) problem in unweighted geometric intersection graphs.
Timothy M. Chan, Dimitrios Skrepetos
doaj +1 more source
Mathematics, 2023 This paper proposes some operations on the cubic intuitionistic set along with useful properties. We propose the internal cubic intuitionistic set (ICIS), the external cubic intuitionistic set (ECIS), P-order, R-order order (P-(R-) order), P-union, R ...
Shahzad Faizi +4 more
doaj +1 more source
Private Multiparty Set Intersection Protocol in Rational Model [PDF]
, 2013 Privacy-preserving set intersection protocol is desirable for many practical applications. Malicious and semihonest adversarial models in cryptographic settings have been considered mostly to design such protocols for privacy-preserving set intersection.
Atsuko Miyaji +5 more
core +1 more source
The Intersection Problem for Finite Monoids [PDF]
, 2018 We investigate the intersection problem for finite monoids, which asks for a given set of regular languages, represented by recognizing morphisms to finite monoids from a variety V, whether there exists a word contained in their intersection.
Kufleitner, Manfred +3 more
core +2 more sources
On the mapping intersection problem [PDF]
Pacific Journal of Mathematics, 1996 Two compacta \(X,Y\) have the unstable intersection property in Euclidean space \(\mathbb{R}^n\) \((X|Y)\) if any maps \(f:X \to\mathbb{R}^n\), \(g:Y\to\mathbb{R}^n\) can be approximated arbitrarily close by maps \(f'\), \(g'\) with disjoint images.
openaire +3 more sources
Automation Countermeasure System for Intersection Optimization
Discrete Dynamics in Nature and Society, 2015 To satisfy the demand of congestion problem solving in intersections, this paper studies the method of automation countermeasure system for intersection optimization (ACSIO).
Hua-pu Lu +3 more
doaj +1 more source
Recognizing weighted and seeded disk graphs
Journal of Computational Geometry, 2022 Disk intersection representations realize graphs by mapping vertices bijectively to disks in the plane such that two disks intersect each other if and only if the corresponding vertices are adjacent in the graph.
Boris Klemz +2 more
doaj +1 more source
Intersection Safety using Lidar and Stereo Vision sensors [PDF]
, 2011 International audienceIn this paper, we describe our approach for intersection safety developed in the scope of the European project INTERSAFE-2. A complete solution for the safety problem including the tasks of perception and risk assessment using on ...
Michel Parent +17 more
core +1 more source