On the Complexity of Triangle Counting Using Emptiness Queries.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/approx/BishnuGM23
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/approx/BishnuGM23
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Arijit_Bishnu
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Arijit_Ghosh
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Gopinath_Mishra
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.4230%2FLIPIcs.APPROX%2FRANDOM.2023.48
>
foaf:
homepage
<
https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.48
>
dc:
identifier
DBLP conf/approx/BishnuGM23
(xsd:string)
dc:
identifier
DOI doi.org%2F10.4230%2FLIPIcs.APPROX%2FRANDOM.2023.48
(xsd:string)
dcterms:
issued
2023
(xsd:gYear)
rdfs:
label
On the Complexity of Triangle Counting Using Emptiness Queries.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Arijit_Bishnu
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Arijit_Ghosh
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Gopinath_Mishra
>
swrc:
pages
48:1-48:22
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/approx/2023
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/approx/BishnuGM23/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/approx/BishnuGM23
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/approx/approx2023.html#BishnuGM23
>
rdfs:
seeAlso
<
https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.48
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/approx
>
dc:
title
On the Complexity of Triangle Counting Using Emptiness Queries.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document