On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/ictcsdm/PandaP16
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/ictcsdm/PandaP16
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Arti_Pandey
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/B._S._Panda_0001
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F978-3-319-64419-6%5F29
>
foaf:
homepage
<
https://doi.org/10.1007/978-3-319-64419-6_29
>
dc:
identifier
DBLP conf/ictcsdm/PandaP16
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F978-3-319-64419-6%5F29
(xsd:string)
dcterms:
issued
2016
(xsd:gYear)
rdfs:
label
On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Arti_Pandey
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/B._S._Panda_0001
>
swrc:
pages
218-227
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/ictcsdm/2016
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/ictcsdm/PandaP16/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/ictcsdm/PandaP16
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/ictcsdm/ictcsdm2016.html#PandaP16
>
rdfs:
seeAlso
<
https://doi.org/10.1007/978-3-319-64419-6_29
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/ictcsdm
>
dc:
title
On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document