Data Analytics for Graphs COMP9312 26T2

Notices

  • Assignment 1 Release

    Posted by Yifan Yang Friday 12 June 2026, 05:17:37 PM.

    Dear students,

    The specification for the first assignment has been released on Webcms. The deadline is 9pm Friday Week 4. We may have some minor updates in the next few days to fix typos or any unclear presentations. Feel free to ask/clarify any details. I will quickly discuss questions in the assignment in Monday lecture.

    Regards,
    Dong

  • Issue of lecture recording

    Posted by Dong Wen Thursday 11 June 2026, 03:59:10 PM, last modified Thursday 11 June 2026, 04:08:40 PM.

    Dear students,

    We identified that the slides were not correctly captured in the recording of yestersday's lecture (thanks for several students reminding us). That is because the cable in the classroom was replaced during last few days, which is not compatible with all Mac devices. We have contacted the IT service team to solve the problem. It will be fixed by the next lecture.

    Below is a summary of the Wednesday lecture:

    I first introduce the adjacency list and CSR. They have the same theoretical time complexity in scanning neighbors and checking if an edge exists or not. CSR is terrible to handle updates, because all neigbhors of nodes are placed in a flat array. However, CSR is often used for static data. It has better practical performance than adjacency list because of the CPU cache. In most graph problems, we often need to vist neighbors of nodes agagin and again. When visit neighbors of a node in CSR, some nearby neighbors may also be cached. In that way, if we visit some cached neighbors, the time for reading RAM can be saved.

    Then, we start to fill a form to study the performance of different graph data structure for scaning neighbors, check edge existence, inserting edge, and deleting edge.

    The results of all contect discussed in the lecture can be summarized by the following table. We completed structures related to RDBMS in the Wednesday lecture. We will go through the rest in the next lecture.

    https://cgi.cse.unsw.edu.au/~cs9312/26T2/lectures/basic_graph_structures.txt


    Regards,

    Dong

  • Welcome from COMP9312_26T2

    Posted by Dong Wen Thursday 28 May 2026, 04:06:14 PM.

    Hi

    Welcome to COMP9312_26T2 Data Analytics for Graphs . In this opening notice, we outline how the course will be run in 26T2 and provide key information to help you get started.

    Course Webpages

    Lectures

    Lectures are delivered in person, while the recordings of lectures should be available through Moodle → Lecture Recordings . Our first lecture will be in 4pm-6pm next Monday . We will introduce the course in the first lecture. The slides will be uploaded to Webcms in Monday morning.

    Tutorials

    Tutorials begin in Week 2 . All tutorials are in-person, and no recording is available. Note that there is no tutorial on Monday Week 2 because of the public holiday. If you have enrolled any tutorial on Monday Week 2, feel free to attend any other tutorial in Week 2.

    Consultations

    Consultations begin in Week 2 and are face-to-face. You can check Timetable on Webcms for available time slots. Consultations are not recorded . Feel free to join if you have any questions.

    Forum

    We use Discourse for Q&A and peer discussion. The entry link can be bounded in the Webcms menu.

    • Tutors will monitor the forum everyday.
    • You will be automatically registered upon your first login.

    Updates

    Compared with previous terms, we add more examples and demo codes in certain topics, including graph neural networks, subgraph enumeration algorithms, etc.

    We hope you enjoy the course and wish you a great start to the term. Looking forward to talking with you on Monday~

    LiC

    Dong Wen

Upcoming Due Dates

There is nothing due!

Back to top

COMP9312 26T2 (Data Analytics for Graphs) is powered by WebCMS3
CRICOS Provider No. 00098G