Results 51 to 60 of about 58,186 (254)
Parameterized Complexity and Approximation Issues for the Colorful Components Problems
, 2018 The quest for colorful components (connected components where each color is associated with at most one vertex) inside a vertex-colored graph has been widely considered in the last ten years.
Dondi, Riccardo, Sikora, Florian
core +2 more sources
“There Are Places Full of Beauty”: Desettling High School Students' Scientific Writing
Science Education, EarlyView.ABSTRACT This study contributes to desettling and expanding expectations about the forms of scientific language that belong in students' scientific writing. The primary empirical focus is the analysis of 52 high school student abstracts articulating community‐based investigations, submitted as part of their participation in a student conference in a ...
Alejandra Frausto Aceves
wiley +1 more source
SensorsProxy re-signature enables transitive authentication of digital identities across different domains and has significant application value in areas such as digital rights management, cross-domain certificate validation, and distributed system access ...
Zhanzhen Wei +4 more
doaj +1 more source
Approximating the Minimum Equivalent Digraph
, 2002 The MEG (minimum equivalent graph) problem is, given a directed graph, to find a small subset of the edges that maintains all reachability relations between nodes. The problem is NP-hard.
Balaji Raghavachari +7 more
core +1 more source
Transitive reduction of a rectangular boolean matrix
Discrete Applied Mathematics, 1984 This paper deals with simplification of rectangular Boolean matrices of zeros and ones. For x,y whose values are zero or one, the following operations are defined \(x+y=\max (x,y), x\Theta y=\max (0,x-y)\) and for \(m\times n\) Boolean matrices A,B, \(A\Theta\) B and \(A\leq B\) are defined elementwise.
openaire +2 more sources
Sustainable Development, EarlyView.ABSTRACT This study investigates how 14 sustainable consumption and production (SCP) factors interact across four service categories—Mass Service, Professional Service, Service Factory, and Service Shop—using interpretive structural modeling (ISM). ISM enables the identification and hierarchical classification of interdependencies among SCP factors in ...
Amanda Duarte Feitosa +4 more
wiley +1 more source
, 2007 Quick note to self, having stumbled on the Wikipedia page on transitive reduction. Given a graph like this:the transitive reduction is:Note that the original graph has an edge a -> d, but this is absent after the reduction because we can get from a to d via b (or c). What's the point?
openaire +1 more source
Strategic Management Journal, EarlyView.Abstract Research Summary We extend ecosystem theory to cases in which platforms are complementors to each other: inter‐platform ecosystems. Analyzing web traffic data on 241 European platforms, we identify and characterize demand‐side inter‐platform ecosystems, and propose a theory of why they emerge.
Bruno Carballa‐Smichowski +3 more
wiley +1 more source
, 2017 We consider the two-variable fragment of first-order logic with one distinguished binary predicate constrained to be interpreted as a transitive relation.
Pratt-Hartmann, Ian
core +1 more source
Transitive reduction of a nilpotent boolean matrix
Discrete Applied Mathematics, 1984 Given an acyclic digraph, a problem which frequently arises in applications consists in removing the maximum number of arcs without affecting reachability. This removal corresponds to a so-called transitive reduction of the adjacency matrix of the given digraph.
openaire +2 more sources