Graphs of separability at most 2

SLO

First page / Show document

Show document

A- | A+ | Print

Title:	Graphs of separability at most 2
Authors:	ID Cicalese, Ferdinando (Author) ID Milanič, Martin (Author)
Files:	http://dx.doi.org/10.1016/j.dam.2011.01.016
Language:	English
Work type:	Not categorized
Typology:	1.08 - Published Scientific Conference Contribution
Organization:	IAM - Andrej Marušič Institute
Keywords:	separability, hereditary class, separating clique, decomposition, induced subgraph, induced minor, parsimony haplotyping
Year of publishing:	2012
Number of pages:	str. 685-696
Numbering:	Vol. 160, iss. 6
PID:	20.500.12556/RUP-4073
ISSN:	0166-218X
UDC:	519.17
COBISS.SI-ID:	1024310612
Publication date in RUP:	15.10.2013
Views:	2459
Downloads:	85
Metadata:
:	Copy citation

Average score:	(0 votes)
Your score:	Voting is allowed only for logged in users.
Share:

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back