Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

Approximating Queries on Probabilistic Graphs

Saved in:
Bibliographic Details
Published in:Logical Methods in Computer Science
Format: Online Article RSS Article
Published: 2025
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1864030189793574921
collection WordPress RSS
FRELIP Feed Integration
container_title Logical Methods in Computer Science
description
discipline_display Engineering & Technology
discipline_facet Engineering & Technology
format Online Article
RSS Article
genre Journal Article
id rss_article:5150
institution FRELIP
journal_source_facet Logical Methods in Computer Science
publishDate 2025
publishDateSort 2025
record_format rss_article
spellingShingle Approximating Queries on Probabilistic Graphs
Computer Science & Information Science
Computer Science & IT
Engineering & Technology
sub_discipline_display Computer Science & IT
sub_discipline_facet Computer Science & IT
subject_display Computer Science & Information Science
Computer Science & IT
Engineering & Technology
Computer Science & Information Science
Computer Science & IT
Engineering & Technology
subject_facet Computer Science & Information Science
Computer Science & IT
Engineering & Technology
title Approximating Queries on Probabilistic Graphs
title_auth Approximating Queries on Probabilistic Graphs
title_full Approximating Queries on Probabilistic Graphs
title_fullStr Approximating Queries on Probabilistic Graphs
title_full_unstemmed Approximating Queries on Probabilistic Graphs
title_short Approximating Queries on Probabilistic Graphs
title_sort approximating queries on probabilistic graphs
topic Computer Science & Information Science
Computer Science & IT
Engineering & Technology
url https://doi.org/10.46298/lmcs-21(4:30)2025