Algorithms for investigating optimality of cone triangulation for a polyhedron
Milica Stojanović, Milica Vučković (2007)
Kragujevac Journal of Mathematics
Similarity:
Milica Stojanović, Milica Vučković (2007)
Kragujevac Journal of Mathematics
Similarity:
Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Meijer, Henk (2005)
Journal of Graph Algorithms and Applications
Similarity:
Edith Hemaspaandra, Jörg Rothe, Holger Spakowski (2006)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
For both the edge deletion heuristic and the maximum-degree greedy heuristic, we study the problem of recognizing those graphs for which that heuristic can approximate the size of a minimum vertex cover within a constant factor of , where is a fixed rational number. Our main results are that these problems are complete for the class of problems solvable via parallel access to . To achieve these main results, we also show that the restriction of the vertex cover problem to those graphs...
Boris Milašinović, Krešimir Fertalj (2012)
Computer Science and Information Systems
Similarity:
Chen, Hon-Chan (2004)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Milica Stojanović (2005)
Matematički Vesnik
Similarity:
Carmignani, Andrea, Di Battista, Giuseppe, Didimo, Walter, Matera, Francesco, Pizzonia, Maurizio (2002)
Journal of Graph Algorithms and Applications
Similarity:
Niessen, Thomas (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Alain Billionnet, Jean-François Brêteau (1989)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Maheshwari, Anil, Zeh, Norbert (2004)
Journal of Graph Algorithms and Applications
Similarity:
Markov, Minko (2008)
Serdica Journal of Computing
Similarity:
We investigate the NP-complete problem Vertex Separation (VS) on Maximal Outerplanar Graphs (mops). We formulate and prove a “main theorem for mops”, a necessary and sufficient condition for the vertex separation of a mop being k. The main theorem reduces the vertex separation of mops to a special kind of stretchability, one that we call affixability, of submops.