Výsledky vyhľadávania - (("graph algorithms in information") OR ("graph algorithms in information"))~

Directed Graphs and Rectangular Layouts (Extended Abstract)

Autori: Adan L. Buchsbaum Emden R. Ganser Suresh Venkatasubramanian a ďalší

Prispievatelia: Adan L. Buchsbaum Emden R. Ganser Suresh Venkatasubramanian a ďalší

Zdroj: http://ieeexplore.ieee.org/iel5/4126199/4100079/04126219.pdf.

Predmety: Graph Algorithms H.5.2 [Information Interfaces and Presentation

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.9480; http://ieeexplore.ieee.org/iel5/4126199/4100079/04126219.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.9480
http://ieeexplore.ieee.org/iel5/4126199/4100079/04126219.pdf

A Survey on Hypergraph Mining: Patterns, Tools, and Generators.

Autori: Lee, Geon Bu, Fanchen Eliassi-Rad, Tina a ďalší

Zdroj: ACM Computing Surveys; Aug2025, Vol. 57 Issue 8, p1-36, 36p

Predmety: HYPERGRAPHS, PATTERN perception, SCIENTIFIC apparatus & instruments, REFERENCE sources

Fair Projections as a Means toward Balanced Recommendations.

Autori: Anagnostopoulos, Aris Becchetti, Luca Böhm, Matteo a ďalší

Zdroj: ACM Transactions on Intelligent Systems & Technology; Feb2025, Vol. 16 Issue 1, p1-32, 32p

Predmety: RECOMMENDER systems, POLYNOMIAL time algorithms, NP-hard problems, SATISFACTION, DATA analysis, APPROXIMATION algorithms

MATHEMATICAL METHODS IN CIBERNETIC SECURITY: GRAPHS AND THEIR APPLICATION IN INFORMATION AND CYBERNETIC SECURITY

Autori: Svitlana Shevchenko Yulia Zhdanovа Svitlana Spasiteleva a ďalší

Zdroj: Кібербезпека: освіта, наука, техніка, Vol 1, Iss 5, Pp 31-39 (2019)
Кібербезпека: освіта, наука, техніка, Vol 1, Iss 13, Pp 133-144 (2021)

Predmety: фрактал, властивості фракталів, моделі фракталів, інформаційна та кібернетична безпека, захист інформації, математичні методи, кібербезпека, граф, граф атак, графові алгоритми, криптографія, 9. Industry and infrastructure, 0202 electrical engineering, electronic engineering, information engineering, Information technology, 02 engineering and technology, T58.5-58.64, 7. Clean energy

Prístupová URL adresa: https://csecurity.kubg.edu.ua/index.php/journal/article/download/288/248
https://doaj.org/article/1bcea12b812946db84ce3a40aa01101c
https://doaj.org/article/9c1e38014c03466195af8671e6e38dbb
https://csecurity.kubg.edu.ua/index.php/journal/article/download/94/99
https://csecurity.kubg.edu.ua/index.php/journal/article/view/94

Graph Generators: State of the Art and Open Challenges.

Autori: BONIFATI, ANGELA HOLUBOVÁ, IRENA PRAT-PÉREZ, ARNAU a ďalší

Zdroj: ACM Computing Surveys; Mar2021, Vol. 53 Issue 2, p1-30, 30p

Predmety: GRAPH algorithms, DATA management, BENCHMARKING (Management), BIG data, SOCIAL networks

A Critical Survey of the Multilevel Method in Complex Networks.

Autori: VALEJO, ALAN FERREIRA, VINÍCIUS FABBRI, RENATO a ďalší

Zdroj: ACM Computing Surveys; Mar2021, Vol. 53 Issue 2, p1-35, 35p

Predmety: PANORAMAS, ALGORITHMS, MOTIVATION (Psychology), LITERATURE, LEARNING

Finding the most navigable path in road networks.

Autori: Kaur, Ramneek Goyal, Vikram Gunturi, Venkata M. V.

Zdroj: GeoInformatica; 2021, Vol. 25 Issue 1, p207-240, 34p

Predmety: DIRECTED graphs, DYNAMIC programming, MAGNITUDE (Mathematics), ORIENTEERING

An Approach For Concept Drift Detection in a Graph Stream Using Discriminative Subgraphs.

Autori: PAUDEL, RAMESH EBERLE, WILLIAM

Zdroj: ACM Transactions on Knowledge Discovery from Data; Oct2020, Vol. 14 Issue 6, p1-25, 25p

Predmety: SUBGRAPHS, SOCIAL media, RIVERS, SENSOR networks, SUPPORT vector machines

Modular design of data-parallel graph algorithms

Autori: Dash S.K. Scholz S.-B. Christianson B.

Zdroj: Proceedings of the 2013 International Conference on High Performance Computing and Simulation, HPCS 2013

Predmety: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Prístupová URL adresa: http://uhra.herts.ac.uk/bitstream/2299/13445/2/apmm2013_submission_5.pdf
https://dblp.uni-trier.de/db/conf/ieeehpcs/ieeehpcs2013.html#DashSC13
http://uhra.herts.ac.uk/bitstream/2299/13445/2/apmm2013_submission_5.pdf
https://uhra.herts.ac.uk/bitstream/handle/2299/13445/apmm2013_submission_5.pdf?sequence=2
https://ieeexplore.ieee.org/document/6641446/
https://uhra.herts.ac.uk/handle/2299/13445

IFZ-Graph and Extracting Shortest Path by IFZ-Dijkstra's Algorithm.

Autori: Biswas, Siddhartha Sankar

Zdroj: International Journal of Advanced Research in Computer Science; Mar/Apr2017, Vol. 8 Issue 3, p364-368, 5p

Predmety: GRAPH theory, INTUITIONISTIC mathematics, ALGORITHMS, FUZZY logic, FUZZY systems

Agent and Spatial Based Parallelization of Biological Network Motif Search.

Autori: Kipps, Matthew Kim, Wooyoung Fukuda, Munehiro

Zdroj: 2015 IEEE 17th International Conference on High Performance Computing & Communications, 2015 IEEE 7th International Symposium on Cyberspace Safety & Security, & 2015 IEEE 12th International Conference on Embedded Software & Systems; 2015, p786-791, 6p

On the Performance of Triangulation-Based Multiple Shooting Method for 2D Geometric Shortest Path Problems.

Autori: An, Phan Thanh Hai, Nguyen Ngoc Hoai, Tran Van a ďalší

Zdroj: Transactions on Large-Scale Data- & Knowledge-Centered Systems XVI; 2014, p45-56, 12p

A novel Bayesian Belief Network structure learning algorithm based on bio-inspired monkey search meta heuristic.

Autori: Mittal, Sangeeta Gopal, Krishna Maskara, S.L.

Zdroj: 2014 Seventh International Conference on Contemporary Computing (IC3); 2014, p141-147, 7p

A new memetic algorithm with GA crossover technique to solve Single Source Shortest Path (SSSP) problem.

Autori: Roy, Pritam

Zdroj: 2014 Annual IEEE India Conference (INDICON); 2014, p1-5, 5p

Obstacle Bypassing in Optimal Ship Routing Using Simulated Annealing.

Autori: Kosmas, O. T. Vlachos, D. S. Simos, T. E.

Zdroj: AIP Conference Proceedings; 11/6/2008, Vol. 1060 Issue 1, p79-82, 4p

Predmety: OPTIMUM ship routing, SIMULATED annealing, COMBINATORIAL optimization, ALGORITHMS, POLYGONS, MATHEMATICAL optimization

Approximate Shortest Path Queries on Weighted Polyhedral Surfaces.

Autori: Královič, Rastislav Urzyczyn, Paweł Aleksandrov, Lyudmil a ďalší

Zdroj: Mathematical Foundations of Computer Science 2006; 2006, p98-109, 12p

Non-Euclidean Spring Embedders.

Autori: Kobourov, S.G. Wampler, K.

Zdroj: IEEE Symposium on Information Visualization; 2004, p207-214, 8p

Inferring and visualizing social networks on Internet relay chat.

Autori: Mutton, P.

Zdroj: Proceedings Eighth International Conference on Information Visualisation, 2004 (IV 2004); 2004, p35-43, 9p

Information Fusion in Distributed Sensor Networks.

Autori: Chong, Chee-Yee Mori, Shozo Chang, Kuo-Chu

Zdroj: 1985 American Control Conference; 1985, p830-835, 6p

Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces.

Autori: Aleksandrov, Lyudmil Djidjev, Hristo Guo, Hua a ďalší

Zdroj: Discrete & Computational Geometry; Dec2010, Vol. 44 Issue 4, p762-801, 40p

Predmety: APPROXIMATION algorithms, PATH analysis (Statistics), POLYHEDRAL functions, GEOMETRIC analysis, BOUNDARY value problems, FIXED point theory, QUERYING (Computer science), DATA structures