Search Results - "da Silva, Murilo V.G."
-
1
Percolation centrality via Rademacher Complexity
Published in Discrete Applied Mathematics (31-12-2022)“…In this work we investigate the problem of estimating the percolation centrality of all vertices in a weighted graph. The percolation centrality measure…”
Get full text
Journal Article -
2
An optimal algorithm for 3D triangle mesh slicing
Published in Computer aided design (01-11-2017)“…We describe an algorithm for slicing an unstructured triangular mesh model by a series of parallel planes. We prove that the algorithm is asymptotically…”
Get full text
Journal Article -
3
A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs
Published in Journal of graph algorithms and applications (01-08-2023)“…Let $G$ be an undirected graph with non-negative edge weights and let $S$ be a subset of its shortest paths such that, for every pair $(u,v)$ of distinct…”
Get full text
Journal Article -
4
Decomposition of even-hole-free graphs with star cutsets and 2-joins
Published in Journal of combinatorial theory. Series B (01-01-2013)“…In this paper we consider the class of simple graphs defined by excluding, as induced subgraphs, even holes (i.e. chordless cycles of even length). These…”
Get full text
Journal Article -
5
Minimum vertex cover in generalized random graphs with power law degree distribution
Published in Theoretical computer science (27-09-2016)“…In this paper we study the approximability of the minimum vertex cover problem in power law graphs. In particular, we investigate the behavior of a standard…”
Get full text
Journal Article -
6
The generalized influence blocking maximization problem
Published in Social network analysis and mining (2021)“…Given a network N and a set of nodes that are the starting point for the spread of misinformation across N and an integer k , in the influence blocking…”
Get full text
Journal Article -
7
Triangulated neighborhoods in even-hole-free graphs
Published in Discrete mathematics (06-05-2007)“…An even-hole-free graph is a graph that does not contain, as an induced subgraph, a chordless cycle of even length. A graph is triangulated if it does not…”
Get full text
Journal Article -
8
On the forbidden induced subgraph sandwich problem
Published in Discrete Applied Mathematics (28-09-2011)“…We consider the sandwich problem, a generalization of the recognition problem introduced by Golumbic et al. (1995) [15], with respect to classes of graphs…”
Get full text
Journal Article Conference Proceeding -
9
The Chromatic Index of Proper Circular-arc Graphs of Odd Maximum Degree which are Chordal
Published in Electronic notes in theoretical computer science (30-08-2019)“…The complexity of the edge-coloring problem when restricted to chordal graphs, listed in the famous D. Johnson's NP-completeness column of 1985, is still…”
Get full text
Journal Article -
10
Perfect subgraph/supergraph
Published in Electronic notes in discrete mathematics (01-06-2005)Get full text
Journal Article -
11
Blocking the Spread of Misinformation in a Network under Distinct Cost Models
Published in 2020 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) (07-12-2020)“…Given a network N and a set of nodes that are the starting point for the spread of misinformation across N and an integer k, in the influence blocking…”
Get full text
Conference Proceeding