Search Results - "da Silva, Murilo V.G."

  • Showing 1 - 11 results of 11
Refine Results
  1. 1

    Percolation centrality via Rademacher Complexity by de Lima, Alane M., da Silva, Murilo V.G., Vignatti, André L.

    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. 2

    An optimal algorithm for 3D triangle mesh slicing by Minetto, Rodrigo, Volpato, Neri, Stolfi, Jorge, Gregori, Rodrigo M.M.H., da Silva, Murilo V.G.

    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. 3

    A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs by De Lima, Alane, Da Silva, Murilo, Vignatti, André

    “…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. 4

    Decomposition of even-hole-free graphs with star cutsets and 2-joins by da Silva, Murilo V.G., Vušković, Kristina

    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. 5

    Minimum vertex cover in generalized random graphs with power law degree distribution by Vignatti, André L., da Silva, Murilo V.G.

    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. 6

    The generalized influence blocking maximization problem by Erd, Fernando C., Vignatti, André L., Silva, Murilo V. G. da

    “…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. 7

    Triangulated neighborhoods in even-hole-free graphs by da Silva, Murilo V.G., Vušković, Kristina

    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. 8

    On the forbidden induced subgraph sandwich problem by Dantas, Simone, de Figueiredo, Celina M.H., da Silva, Murilo V.G., Teixeira, Rafael B.

    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. 9

    The Chromatic Index of Proper Circular-arc Graphs of Odd Maximum Degree which are Chordal by Bernardi, João Pedro W., da Silva, Murilo V.G., Guedes, André Luiz P., Zatesko, Leandro M.

    “…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. 10
  11. 11

    Blocking the Spread of Misinformation in a Network under Distinct Cost Models by Erd, Fernando C., Vignatti, Andre L., da Silva, Murilo V. G.

    “…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