Results 61 to 70 of about 3,292 (264)

Weakly transitive orientations, Hasse diagrams and string graphs [PDF]

, 1993
We introduce the notion of a weakly transitive orientation for graphs as a natural generalization of transitive orientations and give a characterization for weakly transitive orientations in terms of forbidden substructurs.
Pfeiffer, Frank, Middendorf, Matthias
core   +1 more source

Supply Chain Network, ESG Scores and Financial Performance

Business Strategy and the Environment, EarlyView.
ABSTRACT This paper provides novel evidence on the role of supply chain networks in influencing firms' environmental, social and governance (ESG) scores and financial performance. Our analysis employs financial, board, ESG and supply chain data, resulting in an unbalanced panel of over 16,000 firm‐year observations from 3028 publicly traded US firms ...
Michail Filippidis, Renatas Kizys, Panagiotis Tzouvanas   +2 more
wiley   +1 more source

A translational multimodal machine‐learning prototype predicting valproate response in epilepsy treatment

Epilepsia, EarlyView.
Abstract Objective Epilepsy affects ~1% of the global population and often requires lifelong antiseizure medication (ASM) therapy. Valproic acid (VPA) is a commonly prescribed first‐line ASM, yet only approximately half of patients achieve sustained seizure freedom. Treatment selection remains largely empirical.
Simeon Platte, Afsheen Kumar, Giorgia Guerini, Massimo Pandolfo, Denise Haslinger, Colin B. Josephson, Guillermo Delgado‐García, Navprabhjot Kaur, Michaela‐Pauline Lux, Heiko Stempfle, Chantal Depondt, Reetta Kälviäinen, Felix Rosenow, Sophie von Brauchitsch, Karl Martin Klein, Andreas G. Chiocchetti   +15 more
wiley   +1 more source

Indirect Comparison of Neoadjuvant Treatment Strategies for Muscle‐Invasive Bladder Cancer: ddMVAC and Perioperative Durvalumab‐Gemcitabine‐Cisplatin Versus Gemcitabine‐Cisplatin: A Systematic Review and Network Meta‐Analysis of Randomised Controlled Trials

International Journal of Cancer, EarlyView.
Optimizing neoadjuvant therapy for muscle‐invasive bladder cancer patients who are eligible for cisplatin remains difficult, owing particularly to high toxicity and recurrence rates. This meta‐analysis compared dose‐dense methotrexate, vinblastine, doxorubicin, and cisplatin (ddMVAC) against durvalumab plus gemcitabine‐cisplatin (D‐GC) and GC alone ...
Maurin Helen Mangold, Gloria Baumann, Victoria Luise Simone Wieland, Nicolas Carl, Luisa Vivienne Renner, Alexander Studier‐Fischer, Hanna Menold, Stefanie Zschäbitz, Frederik Wessels, Niklas Westhoff, Maurice Stephan Michel, Karl‐Friedrich Kowalewski, Caelán Max Haney‐Aubert   +12 more
wiley   +1 more source

Lattice-Based Certificateless Proxy Re-Signature for IoT: A Computation-and-Storage Optimized Post-Quantum Scheme

Sensors
Proxy 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, Gongjian Lan, Hong Zhao, Zhaobin Li, Zheng Ju   +4 more
doaj   +1 more source

Parallel algorithms for transitive reduction for weighted graphs [PDF]

, 2010
. We present a generalization of transitive reduction for weighted graphs and give scalable polynomial algorithms for computing it based on the Floyd-Warshall algorithm for finding shortest paths in graphs.
Wijs, A.J.; id_orcid, Hilbers, P.A.J., Ligtenberg, WPA Willem, Ligtenberg, W.P.A., Odenbrett, MR Max, Bosnacki, D.; id_orcid, Odenbrett, M.R., Bosnacki, D Dragan, Wijs, AJ Anton, Hilbers, PAJ Peter   +9 more
core  

On the Hardness of Switching to a Small Number of Edges

Journal of Graph Theory, EarlyView.
ABSTRACT Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non‐adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching‐equivalent if one can be made isomorphic to the other one by a sequence of switches. Jelínková et al. [DMTCS 13, no. 2, 2011]
Vít Jelínek, Eva Jelínková, Jan Kratochvíl   +2 more
wiley   +1 more source

q-Distributions in Random Graphs: Transitive Closure and Reduction [PDF]

, 1995
One of the classical topics in discrete mathematics and in computer science is the computation of the transitive closure and reduction of a directed graph. We provide a complete analysis of the random variables counting the size of the transitive closure
Klaus Simon, Davide Crippa
core  

A Min–Max Relation on Dicuts and Dijoins in Weighted Chordal Digraphs

Journal of Graph Theory, EarlyView.
ABSTRACT In a digraph, a dicut is a cut where all the arcs cross in one direction. A dijoin is a subset of arcs that intersects every dicut. Edmonds and Giles conjectured that in a weighted digraph, the minimum weight of a dicut is equal to the maximum size of a packing of dijoins. This has been disproved. However, the unweighted version conjectured by
Gérard Cornuéjols, Siyue Liu, R. Ravi
wiley   +1 more source

Reduction of Bus Transition for Compressed Code Systems

International Journal of VLSI Design & Communication Systems, 2013
Low power VLSI circuit design is one of the most important issues in present day technology. One of the ways of reducing power is to reduce the number of transitions on the bus. The main focus here is to present a method for reducing the power consumption of compressed-code systems by inverting the bits that are transmitted on the bus. Compression will
S. R. Malathi, R. Ramya Asmi
openaire   +2 more sources