Results 171 to 180 of about 952,460 (194)

Vector Domination in split-indifference graphs

Information Processing Letters, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rodrigo Lamblet Mafort, Fábio Protti
openaire   +2 more sources

Gridline indifference graphs

Mathematical Social Sciences, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dale Peterson
openaire   +2 more sources

Block-indifference graphs: Characterization, structural and spectral properties

Discrete Applied Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abreu, Nair Maria Maia de, Justel, Claudia Marcela, Markenzon, Lilian, Oliveira, Carla Silva, Waga, Christina Fraga Esteves Maciel   +4 more
openaire   +3 more sources

Counting and enumerating unlabeled split–indifference graphs

Discrete Mathematics, Algorithms and Applications, 2017
We present in this paper a code for the class of unlabeled split–indifference graphs. This codification allows us to establish the exact number of elements of the class up to isomorphism. In order to obtain this result, structural properties of the class are explored, including a new approach for the characterization theorem.
Lilian Markenzon, Christina F. E. M. Waga   +1 more
openaire   +3 more sources

Single row routing with indifference graphs on the DAP

Proceedings IEEE Southeastcon '92, 2003
The distributed array of processors (DAP) is a commercially available massively parallel machine which is often applied to numerically intensive problems which exploit its matrix manipulation abilities. It is shown that the DAP can be efficiently used to solve non-numerical problems as well.
D. Chennapragada, P.J. Looges, S. Olariu
openaire   +2 more sources

GREEDY RECOGNITION AND COLORING ALGORITHMS FOR INDIFFERENCE GRAPHS

, 1992
Peter J. Looges, Stephan Olariu
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Graph Networks as Learnable Engines for Relations Inference of Interacting Financial Systems

International Conference on Machine Learning and Computing, 2021
Although the heterogeneous of financial markets is attracting interest both among scholars and practitioners, however, attention was almost exclusively given to networks in which all individuals were treated indifference, while neglecting all the extra ...
Jiayu Pi, Yuan Deng
semanticscholar   +1 more source

Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers

European Conference on Computer Vision, 2020
Building on recent progress at the intersection of combinatorial optimization and deep learning, we propose an end-to-end trainable architecture for deep graph matching that contains unmodified combinatorial solvers.
Michal Rolinek, P. Swoboda, Dominik Zietlow, Anselm Paulus, Vít Musil, G. Martius   +5 more
semanticscholar   +1 more source

Verified Language Processing with Hybrid Explainability: A Technical Report

Electronics
The volume and diversity of digital information have led to a growing reliance on Machine Learning (ML) techniques, such as Natural Language Processing (NLP), for interpreting and accessing appropriate data.
Oliver Robert Fox, Giacomo Bergami, Graham Morgan   +2 more
semanticscholar   +1 more source

A Hybrid Stochastic-Full Enumeration Approach to a Ranking Problem with Insufficient Information

Annual Conference on Information Sciences and Systems
When comparing n objects pairwise, at least (n−1) comparisons have to be performed (assuming that a corresponding directed graph is connected) for a derivation of a ranking (a total or partial order) of all objects. The aim of the paper is to introduce a
Jirí Mazurek, Ryszard Janicki
semanticscholar   +1 more source