12 citations · 23 across the 13 of their papers we have counts for
Showing 2019 · cs.DSShow all
2 papers · 2 filters
cs.DS2019
Efficient Implementation of Color Coding Algorithm for Subgraph Isomorphism Problem
Josef Malík, Ondřej Suchý, Tomáš Valla
We consider the subgraph isomorphism problem where, given two graphs G (source graph) and F (pattern graph), one is to decide whether there is a (not necessarily induced) subgraph…
cs.DS2019
On the m-eternal Domination Number of Cactus Graphs
Václav Blažej, Jan Matyáš Křišťan, Tomáš Valla
Given a graph , guards are placed on vertices of . Then vertices are subject to an infinite sequence of attacks so that each attack must be defended by a guard moving from a…