Timeful (formerly Schej) - Find a time to meet

Span-reachability querying in large temporal graphs

Reachability is a fundamental problem in graph analysis. In applications such as social networks and collaboration networks, edges are always associated with timestamps. Most existing works on reachability queries in temporal graphs assume that two vertices are related if they are connected by a path with non-decreasing timestamps (time-respecting) of edges. This assumption fails to capture the relationship between entities involved in the same group or activity with no time-respecting path connecting them. In this paper, we define a new reachability model, called span-reachability, designed to relax the time order dependency and identify the relationship between entities in a given time period. We adopt the idea of two-hop cover and propose an index-based method to answer span-reachability queries. Several optimizations are also given to improve the efficiency of index construction and query processing. We conduct extensive experiments on eighteen real-world datasets to show the efficiency of our proposed solution.

Open-Source Meeting Scheduling Software · Tymeslot

Eliminate scheduling back-and-forth with Tymeslot. Share your availability, let others book instantly, and sync with your calendar and video tools.

Rallly: Free Group Meeting Scheduling Tool

Rallly is the fastest and easiest scheduling and collaboration tool. Create a meeting poll in seconds, no login required.

Efficient Processing of Reachability and Time-Based Path Queries in a Temporal Graph

A temporal graph is a graph in which vertices communicate with each other at specific time, e.g., $A$ calls $B$ at 11 a.m. and talks for 7 minutes, which is modeled by an edge from $A$ to $B$ with starting time "11 a.m." and duration "7 mins". Temporal graphs can be used to model many networks with time-related activities, but efficient algorithms for analyzing temporal graphs are severely inadequate. We study fundamental problems such as answering reachability and time-based path queries in a temporal graph, and propose an efficient indexing technique specifically designed for processing these queries in a temporal graph. Our results show that our method is efficient and scalable in both index construction and query processing.

OpenMeet – Free, Open-Source Alternative to Meetup

The free, open-source alternative to Meetup. Create groups and events for your community — no fees, no ads, community-owned forever.

OpenMeet – Free, Open-Source Alternative to Meetup

The free, open-source alternative to Meetup. Create groups and events for your community — no fees, no ads, community-owned forever.

Avails — Group Scheduling

Open-source group scheduling on the AT Protocol. Your polls live in your Bluesky account.

Partiful - Free Online Invitations with RSVP Tracking

Plan events in seconds, with actually fun event pages. Invite guests on any platform. Easily coordinate via Text Blasts and automatic reminders. Share photos, comments, and more.

OpenMeet - Your Community, Your Privacy, Your Power

The free, open-source alternative to Meetup. Create groups and events for your community — no fees, no ads, community-owned forever.

OpenMeet - Your Community, Your Privacy, Your Power

The free, open-source alternative to Meetup. Create groups and events for your community — no fees, no ads, community-owned forever.

Meet n Code - Tuesday | Meetup

Join us on our Discord Serverhttps://discord.gg/TPjH8uWAGWThis is a group for people who want to meet up with other programmers and code. Be as social or as unsocial as you like.There is no agenda. There is no topic. This Meetup is language agnostic and all skill levels are welcome. Show up with a l

thunderbird/appointment

Invite others to grab times on your calendar. Choose a date. Make appointments as easy as it gets.