Results 61 to 70 of about 8,099 (222)

Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices

Journal of Graph Theory, EarlyView.
ABSTRACT Given a graph G $G$, we say that an orientation D $D$ of G $G$ is a KT orientation if, for all u , v ∈ V ( D ) $u,v\in V(D)$, there is at most one directed path (in any direction) between u $u$ and v $v$. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as ...
Barbora Dohnalová, Jiří Kalvoda, Gaurav Kucheriya, Sophie Spirkl   +3 more
wiley   +1 more source

An Extended Formulation With Valid Inequalities for the Capacitated Steiner Arborescence Problem

Networks, EarlyView.
ABSTRACT Given a directed graph, the Capacitated Steiner Arborescence Problem (CSAP) aims to determine the least‐cost connection from the root node to terminal nodes requiring a demand through Steiner nodes coming with a capacity, such that there is a unique path from the root to each terminal. This paper presents a new extended formulation of the CSAP,
Francesco Contu, Massimo Di Francesco, Enrico Gorgone, Ishwar Murthy   +3 more
wiley   +1 more source

Disperse hypergraphs

Combinatorics, Probability and Computing
Abstract For $\ell \geq 3$ , an $\ell$
Lior Gishboliner, Ethan Honest
openaire   +2 more sources

Hypergraphs with edge-dependent vertex weights: p-Laplacians and spectral clustering

Frontiers in Big Data, 2023
We study p-Laplacians and spectral clustering for a recently proposed hypergraph model that incorporates edge-dependent vertex weights (EDVW). These weights can reflect different importance of vertices within a hyperedge, thus conferring the hypergraph ...
Yu Zhu, Santiago Segarra
doaj   +1 more source

A Dynamic Correlation‐Information‐Fusion‐Based Spatiotemporal Network for Traffic Flow Forecasting

CAAI Transactions on Intelligence Technology, EarlyView.
ABSTRACT Traffic Flow Forecasting (TFF) is a foundational task in the development of Intelligent Transport Systems (ITSs). The primary challenge is to undertake a comprehensive exploration of the intrinsic dynamic spatiotemporal correlations of the road network, unveiling the long‐term evolutionary traffic trends.
Dawen Xia, Zhan Lin, Xingyan Wang, Ruixi Huang, Jinhui Hu, Yang Hu, Huaqing Li   +6 more
wiley   +1 more source

Partitive hypergraphs

, 1981
We define a new class of hypergraphs (partitive hypergraphs) which generalizes both, the set of all externally related subsets of a graph and the set of all committees of an hypergraph.We give a characterization of the partitive hypergraphs and moreover ...
Chein, M., Maurer, M.C., Habib, M.
core   +1 more source

A Novel Full‐Chain Loop Tracking Auditing Framework for Obtaining Audit Evidence With Reasonable Assurance

CAAI Transactions on Intelligence Technology, EarlyView.
ABSTRACT As an attestation engagement, auditing is required to provide reasonable assurance for its conclusions. Traditional auditing has limited capacity to handle unstructured data and is usually based on audit sampling techniques, which can lead to the neglect of important audit evidence during the auditing process and result in a higher audit risk,
Xiaojia Wang, Ziqing Luo, Chaoxu Mu
wiley   +1 more source

CLusterix: A Hybrid Visualization Model for Hierarchically Clustered Networks

Computer Graphics Forum, EarlyView.
Abstract We introduce Clusterix, a novel hybrid visualization model for representing hierarchically clustered networks, which also supports directed and weighted edges. Clusterix offers an integrated view of both the network and its full cluster hierarchy by compactly visualizing the cluster inclusion tree enriched with links of the network.
Carla Binucci, Annika Bonerath, Walter Didimo, Henry Förster, Seok‐Hee Hong, Maria Eleni Pavlidi, Alessandra Tappini   +6 more
wiley   +1 more source

Autoregressive Hypergraph

Journal of Time Series Analysis, EarlyView.
ABSTRACT Traditional graph representations are insufficient for modelling real‐world phenomena involving multi‐entity interactions, such as collaborative projects or protein complexes, necessitating the use of hypergraphs. While hypergraphs preserve the intrinsic nature of such complex relationships, existing models often overlook temporal evolution in
Xianghe Zhu, Qiwei Yao
wiley   +1 more source

Split Hypergraphs

SIAM Journal on Discrete Mathematics, 2008
Generalizing the notion of split graphs to uniform hypergraphs, we prove that the class of these hypergraphs can be characterized by a finite list of excluded induced subhypergraphs. We show that a characterization by generalized degree sequences is impossible, unlike in the well-known case of split graphs. We also give an algorithm to decide whether a
openaire   +2 more sources