Search results

...onal Conference on Information Processing and Management of Uncertainty in Knowledge Based Systems IPMU '88. Urbino, Italy, July 4-7, 1988. Proceedings|url=http ...G. Simonyi, "Perfect graphs and graph entropy. An updated survey," Perfect Graphs, John Wiley and Sons (2001) pp. 293-328, Definition 2”</ref> ...

...term for the arcs. This is why a clearer name is ''attributed graphs,'' or graphs'' with'' properties. .... Alternatively, and more consistently, labels can be defined through type graphs, as special types associated with nodes and arcs. ...

Most performance and flight planning graphs and tables use either degrees [[Celsius]] or [[Fahrenheit]] or both. The [[ ...es/handbooks_manuals/aviation/phak/|title=Pilot's Handbook of Aeronautical Knowledge|work=Federal Aviation Administration|date=2016-08-24}}</ref> particularly i ...

'''Skip graphs''' are a kind of distributed data structure based on [[skip list]]s. ...ll functionality of a [[balanced tree]] in a [[distributed system]]. Skip graphs are mostly used in searching [[peer-to-peer network]]s. As they provide the ...

...ollaborative relationship between them of a particular kind. Collaboration graphs are used to measure the closeness of collaborative relationships between th The most well-studied collaboration graphs include: ...

...e level, and has exercises making it suitable as a graduate textbook. Some knowledge of topology would be helpful for readers but is not necessary. Reviewer Mih ...

...presentation language]]. AMR graphs are rooted, labeled, directed, acyclic graphs ([[Directed acyclic graph|DAGs]]), comprising whole sentences. They are int ...clanthology.org/C98-1112 Generation that Exploits Corpus-Based Statistical Knowledge], In COLING 1998 Volume 1: The 17th International Conference on Computation ...

{{Short description|Type of Knowledge Graph Management System}} ...018-05-01 |title=The Vadalog system: datalog-based reasoning for knowledge graphs |url=https://doi.org/10.14778/3213880.3213888 |journal=Proceedings of the V ...

| conference = ACM SIGKDD International Conference on Knowledge Discovery and Data Mining Mean first passage time is not symmetric, even for undirected graphs. ...

...trics]], [[epidemiology]], [[genetics]] and related disciplines, '''causal graphs''' (also known as [[Path analysis (statistics)|path diagrams]], causal [[Ba ...s that researchers may wish to convey and defend. As inference tools, the graphs enable researchers to estimate effect sizes from non-experimental data,<ref ...

...is asymptotically optimal for single node initialisation on non-bipartite graphs. ...For example, a modified variant requiring the initial set to retain their knowledge of this membership and the message for a single round, but always requiring ...

...similarity]] (or dissimilarity) between two [[Graph (discrete mathematics)|graphs]]. |title=A distance measure between attributed relational graphs for pattern recognition ...

| title = On a class of posets and the corresponding comparability graphs ...to represent reachability relations in directed trees and series parallel graphs.<ref name="m"/><ref name="vtl"/> ...

...ic second-order]] [[logic of graphs]] can be decided in [[linear time]] on graphs of bounded [[treewidth]].<ref>{{citation|title=Regular Languages, Tree Widt ...= The monadic second-order logic of graphs. I. Recognizable sets of finite graphs ...

...e lattices and [[partial order]]s, between [[Knowledge space|quasi-ordinal knowledge spaces]] and [[preorder]]s, or between [[finite topological space]]s and pr ...vtxt|Doignon|Falmagne|1999}} called the same structure a ''quasi-ordinal [[knowledge space]]''. If the sets in a ring of sets are ordered by inclusion, they for ...

...|first1=Julia |last2=Rank |first2=Olaf |date=2017-05-01 |title=The firm's knowledge network and the transfer of advice among corporate inventors—A multilevel n ...ables (<math>Y_{12},Y_{13},Y_{23}</math>) and <math>2^3=8</math> different graphs in this example. ...

...t2=Görgen |first2=Christiane |last3=Smith |first3=Jim Q |title=Chain event graphs |date=2018 |publisher=CRC Press}}</ref> People often understand things thro ...t2=Anderson |first2=Paul E |title=Conditional independence and chain event graphs |journal=Artificial Intelligence |date=2008 |volume=172 |issue=1 |pages=42– ...

...ts. Thus, ''relative graphlet frequency distance'' ''D(G,H)'' between two graphs ''G'' and ''H'' is defined as:<br /> ...is Floros, Nikos Pitsianis, Xiaobai Sun, Fast graphlet transform of sparse graphs, IEEE HPEC 2020</ref> ...

...dy peeling procedure yields about 80% of the optimal density on real-world graphs.<ref name=":2" /> ...blem generalizes the [[clique problem]] and is thus [[NP-hard]] in general graphs. There exists a polynomial algorithm approximating the densest {{mvar|k}} s ...

...last=Gujral |first=Ekta |date=2022 |title=Modeling and Mining Multi-Aspect Graphs With Scalable Streaming Tensor Decomposition |class=cs.SI |eprint=2210.0440 ...d Extrinsic Causal Factors|conference=In The 25th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD’19): Tensor Methods for Emerging Data Scienc ...