id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
bracis-28347	Sampaio, Igor M.; Lima, Karla Roberta P. S.	A Combinatorial Optimization Model and Polynomial Time Heuristic for a Problem of Finding Specific Structural Patterns in Networks	2023		.htm	text/html	5601	251	56	In general the problem of searching for tropical subgraphs in vertex colored graphs has been explored extensively for some classes of graphs; for more details see [1, 3, 6]. Results of the computational experiments on real-world instances for graphs in generalFull size table From the perspective of random graph instances in general, the heuristic algorithm found the integer optimal solution for \(28.26\%\) of the instances; \(86.96\%\) of the instances presented a gap, that is, a difference, in percent, between the integer optimal solution presented by the ILP model and the solution of the heuristic algorithm, of less than \(30\%\); and \(60.87\%\) of the instances presented a gap of less than \(10\%\).	cache/bracis-28347.htm	txt/bracis-28347.txt