scientific article; zbMATH DE number 2230201

MaRDI QIDQ5708487zbMATH OpenFDO

Authors Pablo Burzyn, Guillermo Durán, Flavia Bonomo

Publication date 18 November 2005

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

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(3)

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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5708487)