scientific article; zbMATH DE number 2230201

zbMath1075.05600MaRDI QIDQ5708487

Guillermo Durán, Pablo Burzyn, Flavia Bonomo-Braberman

Publication date: 18 November 2005

Full work available at URL: http://www.sciencedirect.com/science/journal/15710653

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Minimum \(d\)-blockers and \(d\)-transversals in graphs ⋮ On the complexity of some subgraph problems ⋮ NP-completeness results for edge modification problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Orienting graphs to optimize reachability
• On local convexity in graphs
• The splittance of a graph
• Some simplified NP-complete graph problems
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Some complexity results about threshold graphs
• On the complexity of DNA physical mapping
• Algorithms for weakly triangulated graphs
• Matrix characterizations of circular-arc graphs
• The complexity of some edge deletion problems
• Edge-Deletion Problems
• Computing the Minimum Fill-In is NP-Complete
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Graph Classes: A Survey
• Recognition of Circle Graphs
• Polynomial time recognition of unit circular-arc graphs
• Partially Ordered Sets
• Complexity classification of some edge modification problems
• On intervalizing \(k\)-colored graphs for DNA physical mapping

This page was built for publication: