An intersection model for multitolerance graphs: efficient algorithms and hierarchy
From MaRDI portal
Graph representations (geometric and intersection representations, etc.) (05C62) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Protein sequences, DNA sequences (92D20)
Recommendations
- An intersection model for multitolerance graphs: efficient algorithms and hierarchy
- A new intersection model and improved algorithms for tolerance graphs
- A new intersection model and improved algorithms for tolerance graphs
- New geometric representations and domination problems on tolerance and multitolerance graphs.
- New geometric representations and domination problems on tolerance and multitolerance graphs
Cited in
(8)- A characterization of interval orders with semiorder dimension two
- An intersection model for multitolerance graphs: efficient algorithms and hierarchy
- New geometric representations and domination problems on tolerance and multitolerance graphs
- A new intersection model and improved algorithms for tolerance graphs
- Max point-tolerance graphs
- The recognition of triangle graphs
- scientific article; zbMATH DE number 867635 (Why is no real title available?)
- A new intersection model and improved algorithms for tolerance graphs
This page was built for publication: An intersection model for multitolerance graphs: efficient algorithms and hierarchy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365119)
