Results 71 to 80 of about 137 (126)
The Serial Transitive Closure Problem for Trees
, 2002 The serial transitive closure problem is the problem of, given a directed graph G and a list of edges, called closure edges, which are in the transitive closure of the graph, to generate all the closure edges from edges in G.
core
Eccentricity of Networks with Structural Constraints
Discussiones Mathematicae Graph Theory, 2020 The eccentricity of a node v in a network is the maximum distance from v to any other node. In social networks, the reciprocal of eccentricity is used as a measure of the importance of a node within a network.
Krnc Matjaž +3 more
doaj +1 more source
Total-Chromatic Number and Chromatic Index of Dually Chordal Graphs
, 2007 A graph is dually chordal if it is the clique graph of a chordal graph. Alternatively, a graph is dually chordal if it admits a maximum neighbourhood order. This class generalizes known subclasses of chordal graphs such as doubly chordal graphs, strongly
Celina M. H. De Figueiredo +3 more
core
Chordality and 2-factors in tough graphs [PDF]
, 1998 AgraphG is chordal if it contains no chordless cycle of length at least four and is k-chordal if a longest chordless cycle in G has length at most k.Inthis note it is proved that all 3 2 -tough 5-chordal graphs have a 2-factor.
Veldman, H.J. +3 more
core +1 more source
Labeling schemes for small distances in trees
, 2003 . We consider labeling schemes for trees, supporting various relationships between nodes at small distance. For instance, we show that given a tree T and an integer k we can assign labels to each node of T such that given the label of two nodes we can ...
Stephen Alstrup +2 more
core
A $4/3$ Approximation for $2$-Vertex-Connectivity [PDF]
TheoretiCSThe 2-Vertex-Connected Spanning Subgraph problem (2VCSS) is among the most basic NP-hard (Survivable) Network Design problems: we are given an (unweighted) undirected graph $G$.
Miguel Bosch-Calvo +2 more
doaj +1 more source
Partitioning of finite element meshes for parallel computing: A case study
, 1997 . The realization of the finite element method on parallel computers is usually based on a domain decomposition approach. This paper is concerned with the problem of finding an optimal decomposition and an appropriate mapping of the subdomains to the ...
Uwe Reichel, Thomas Apel
core
, 1993 We introduce and study online versions of weighted matching problems in metric spaces. We present a simple 2k \Gamma 1 competitive algorithm for online minimum weighted bipartite matching where 2k is the number of nodes. We show that this competitiveness
Kirk Pruhs, Bala Kalyanasundaram
core
Edge Disjoint Paths in Moderately Connected Graphs
, 2006 . We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as possible us-ing paths that are mutually edge disjoint.
Satish Rao, Shuheng Zhou
core +1 more source
Network structural properties and their application to missing property prediction [PDF]
, 2013 The volume of available structured data is increasing, particularly in the form of Linked Data, where relationships between individual pieces of data are encoded by a graph-like structure.
Simonič, Klemen
core +1 more source