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
ORTHOGONAL TRACE-SUM MAXIMIZATION: TIGHTNESS OF THE SEMIDEFINITE RELAXATION AND GUARANTEE OF LOCALLY OPTIMAL SOLUTIONS. [PDF]
SIAM J Optim, 2022 Won JH, Zhang T, Zhou H.
europepmc +1 more source
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
Revisiting structure graphs: Applications to CBC-MAC and EMAC
Journal of Mathematical Cryptology, 2016 In [2], Bellare, Pietrzak and Rogaway proved an O(ℓq2/2n)${O(\ell q^{2}/2^{n})}$ bound for the PRF (pseudorandom function) security of the CBC-MAC based on an n-bit random permutation Π, provided ...
Jha Ashwin, Nandi Mridul
doaj +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
An Asymptotically Optimal Minimum Degree Ordering of Regular Grids
, 1995 It has previously been shown that there exists a minimum degree ordering for regular grids that is considerably worse than nested dissection in terms of fill-in and operations for factorization [1].
Kumar Sadayappan, C. -h. Huang, B. Kumar
core
Modeling calcium dynamics in neurons with endoplasmic reticulum: existence, uniqueness and an implicit-explicit finite element scheme. [PDF]
Commun Nonlinear Sci Numer Simul, 2022 Guan Q, Queisser G.
europepmc +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
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
Inserting One Edge into a Simple Drawing is Hard. [PDF]
Discrete Comput Geom, 2023 Arroyo A +5 more
europepmc +1 more source