scientific article; zbMATH DE number 2230201

zbMATH Open1075.05600MaRDI QIDQ5708487FDOQ5708487

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

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Minimum \(d\)-blockers and \(d\)-transversals in graphs
• On the complexity of some subgraph problems
• 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)