Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2921688
Jump to:navigation, search

zbMath1297.05166MaRDI QIDQ2921688

Zohar Yakhini, Yonatan Aumann, Oren Melamud, Moshe Lewenstein, Ron Yair Pinter

Publication date: 13 October 2014


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


Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Genetics and epigenetics (92D10) Graph representations (geometric and intersection representations, etc.) (05C62)


Related Items (4)

Approximating minimum coloring and maximum independent set in dotted interval graphs ⋮ Approximation algorithm for coloring of dotted interval graphs ⋮ On the parameterized complexity of multiple-interval graph problems ⋮ The maximum clique problem in multiple interval graphs




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2921688&oldid=15892766"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 21:13.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki