[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/lcn/SuhC00>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Carl_K._Chang>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Heejong_Suh>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2FLCN.2000.891015>
foaf:homepage <https://doi.org/10.1109/LCN.2000.891015>
dc:identifier DBLP conf/lcn/SuhC00 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2FLCN.2000.891015 (xsd:string)
dcterms:issued 2000 (xsd:gYear)
rdfs:label Algorithms for the Minimal Cutsets Enumeration of Networks by Graph Search and Branch Addition. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Carl_K._Chang>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Heejong_Suh>
swrc:pages 100-107 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/lcn/2000>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/lcn/SuhC00/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/lcn/SuhC00>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/lcn/lcn2000.html#SuhC00>
rdfs:seeAlso <https://doi.org/10.1109/LCN.2000.891015>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/lcn>
dc:subject graph theory; network topology; computational complexity; reliability; minimal cutsets enumeration; graph search; branch addition; algorithms; networks; graph method; spanning tree; graph tree; binary tree; sub-vertex set; graph topology; time complexity; disjoint vertex set; reliability (xsd:string)
dc:title Algorithms for the Minimal Cutsets Enumeration of Networks by Graph Search and Branch Addition. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document