This feels like it ought to be a case of the Konigsberg Bridge Problem.
The Encyclopedia Britannica version of the modernised graph theory begins: if there is a path along edges of a multigraph that traverses each edge once and only once, then there exist at most two vertices of odd degree.
The Encyclopedia Britannica version of the modernised graph theory begins: if there is a path along edges of a multigraph that traverses each edge once and only once, then there exist at most two vertices of odd degree.
April 21, 2025 at 11:47 AM
This feels like it ought to be a case of the Konigsberg Bridge Problem.
The Encyclopedia Britannica version of the modernised graph theory begins: if there is a path along edges of a multigraph that traverses each edge once and only once, then there exist at most two vertices of odd degree.
The Encyclopedia Britannica version of the modernised graph theory begins: if there is a path along edges of a multigraph that traverses each edge once and only once, then there exist at most two vertices of odd degree.
Paper (24 Sep 2025, 29 pages) presents two GNN routing approaches for multigraphs: a direct autoregressive model and a pruned‑graph variant that speeds computation while keeping performance. https://getnews.me/neural-multi-objective-routing-on-multigraphs-new-gnn-approaches/ #multigraph #gnn
September 27, 2025 at 2:56 AM
Paper (24 Sep 2025, 29 pages) presents two GNN routing approaches for multigraphs: a direct autoregressive model and a pruned‑graph variant that speeds computation while keeping performance. https://getnews.me/neural-multi-objective-routing-on-multigraphs-new-gnn-approaches/ #multigraph #gnn
This week’s @99piorg is an 18th centuryist talking about the language of color over time. Kasha St Clair may have given me the model for how to write the comparable smelly book (@trickyholly we should sit down next month and imagine a kind of multigraph?)
December 7, 2024 at 11:27 PM
This week’s @99piorg is an 18th centuryist talking about the language of color over time. Kasha St Clair may have given me the model for how to write the comparable smelly book (@trickyholly we should sit down next month and imagine a kind of multigraph?)
strongly connected components (SCCs): in this case, x is the maximal cutwidth of an SCC, and y is the cutwidth of the directed acyclic condensation multigraph.
We show that the cutwidth of a graph is always in O(x + y), specifically it can be upper [3/4 of https://arxiv.org/abs/2504.01574v1]
We show that the cutwidth of a graph is always in O(x + y), specifically it can be upper [3/4 of https://arxiv.org/abs/2504.01574v1]
April 3, 2025 at 5:57 AM
strongly connected components (SCCs): in this case, x is the maximal cutwidth of an SCC, and y is the cutwidth of the directed acyclic condensation multigraph.
We show that the cutwidth of a graph is always in O(x + y), specifically it can be upper [3/4 of https://arxiv.org/abs/2504.01574v1]
We show that the cutwidth of a graph is always in O(x + y), specifically it can be upper [3/4 of https://arxiv.org/abs/2504.01574v1]
Was not expecting the Multigraph Junior No. 40 to be smaller than the Heyer Spirit Duplicator that I’m restoring for @elizott.bsky.social
March 29, 2024 at 6:34 PM
Was not expecting the Multigraph Junior No. 40 to be smaller than the Heyer Spirit Duplicator that I’m restoring for @elizott.bsky.social
Does the multigraph collective’s ‘interacting with print’ have a chapter on proofs/ information on this? I can’t recall. I presume it’s related to the decline in lists of Errata? Perhaps try ‘Cambridge History of the Book in Britain, vol. 5’.
August 25, 2023 at 2:47 PM
Does the multigraph collective’s ‘interacting with print’ have a chapter on proofs/ information on this? I can’t recall. I presume it’s related to the decline in lists of Errata? Perhaps try ‘Cambridge History of the Book in Britain, vol. 5’.
I would imagine Multigraph budget will be growing big time to accommodate lots more re-election mailings, I mean ward mailings with important information on how many courtesy resolutions Alders sponsor, awards they get, etc.
August 16, 2023 at 5:53 PM
I would imagine Multigraph budget will be growing big time to accommodate lots more re-election mailings, I mean ward mailings with important information on how many courtesy resolutions Alders sponsor, awards they get, etc.
Stream's up! Doing a general/exploratory disassemble and clean of the multigraph, trying to put together a list of what needs doing
July 11, 2025 at 10:53 PM
Stream's up! Doing a general/exploratory disassemble and clean of the multigraph, trying to put together a list of what needs doing
Pajek network: SmallW citation network
Size: 396x396
Nonzeros: 994
Kind: Directed Multigraph
Author: E. Garfield
Date: 2002
Link: https://sparse.tamu.edu/Pajek/SmallW
Size: 396x396
Nonzeros: 994
Kind: Directed Multigraph
Author: E. Garfield
Date: 2002
Link: https://sparse.tamu.edu/Pajek/SmallW
October 25, 2025 at 12:00 PM
Pajek network: SmallW citation network
Size: 396x396
Nonzeros: 994
Kind: Directed Multigraph
Author: E. Garfield
Date: 2002
Link: https://sparse.tamu.edu/Pajek/SmallW
Size: 396x396
Nonzeros: 994
Kind: Directed Multigraph
Author: E. Garfield
Date: 2002
Link: https://sparse.tamu.edu/Pajek/SmallW
Pajek network: Lederberg citation network
Size: 8843x8843
Nonzeros: 41601
Kind: Directed Multigraph
Author: E. Garfield
Date: 2002
Link: https://sparse.tamu.edu/Pajek/Lederberg
Size: 8843x8843
Nonzeros: 41601
Kind: Directed Multigraph
Author: E. Garfield
Date: 2002
Link: https://sparse.tamu.edu/Pajek/Lederberg
January 27, 2025 at 6:00 PM
Pajek network: Lederberg citation network
Size: 8843x8843
Nonzeros: 41601
Kind: Directed Multigraph
Author: E. Garfield
Date: 2002
Link: https://sparse.tamu.edu/Pajek/Lederberg
Size: 8843x8843
Nonzeros: 41601
Kind: Directed Multigraph
Author: E. Garfield
Date: 2002
Link: https://sparse.tamu.edu/Pajek/Lederberg
characterization for determining if there is a bipartite multigraph realization such that the total number of excess edges is at most $t$. We show that optimizing these two measures may lead to different realizations, and [6/9 of https://arxiv.org/abs/2501.15515v1]
January 28, 2025 at 6:11 AM
characterization for determining if there is a bipartite multigraph realization such that the total number of excess edges is at most $t$. We show that optimizing these two measures may lead to different realizations, and [6/9 of https://arxiv.org/abs/2501.15515v1]
SNAP network: Ask Ubuntu temporal network
Size: 159316x159316
Nonzeros: 596933
Kind: Directed Temporal Multigraph
Author: A. Paranjape, A. R. Benson, and J. Leskovec
Date: 2017
Link: https://sparse.tamu.edu/SNAP/sx-askubuntu
Size: 159316x159316
Nonzeros: 596933
Kind: Directed Temporal Multigraph
Author: A. Paranjape, A. R. Benson, and J. Leskovec
Date: 2017
Link: https://sparse.tamu.edu/SNAP/sx-askubuntu
November 29, 2024 at 6:00 PM
SNAP network: Ask Ubuntu temporal network
Size: 159316x159316
Nonzeros: 596933
Kind: Directed Temporal Multigraph
Author: A. Paranjape, A. R. Benson, and J. Leskovec
Date: 2017
Link: https://sparse.tamu.edu/SNAP/sx-askubuntu
Size: 159316x159316
Nonzeros: 596933
Kind: Directed Temporal Multigraph
Author: A. Paranjape, A. R. Benson, and J. Leskovec
Date: 2017
Link: https://sparse.tamu.edu/SNAP/sx-askubuntu
$A\subseteq V(H)$ with $|A|\geq 2$, the induced subgraph $H[A]$ has at most $a|A|+b$ edges. Forests are exactly $(1,-1)$-sparse multigraphs. It is known that the vertex set of any $(2,-1)$-sparse multigraph can be partitioned into two parts each of [2/5 of https://arxiv.org/abs/2505.17408v1]
May 26, 2025 at 6:02 AM
$A\subseteq V(H)$ with $|A|\geq 2$, the induced subgraph $H[A]$ has at most $a|A|+b$ edges. Forests are exactly $(1,-1)$-sparse multigraphs. It is known that the vertex set of any $(2,-1)$-sparse multigraph can be partitioned into two parts each of [2/5 of https://arxiv.org/abs/2505.17408v1]
Pajek network: SciMet citation network
Size: 3084x3084
Nonzeros: 10413
Kind: Directed Multigraph
Author: E. Garfield
Date: 2002
Link: https://sparse.tamu.edu/Pajek/SciMet
Size: 3084x3084
Nonzeros: 10413
Kind: Directed Multigraph
Author: E. Garfield
Date: 2002
Link: https://sparse.tamu.edu/Pajek/SciMet
October 12, 2025 at 6:00 PM
Pajek network: SciMet citation network
Size: 3084x3084
Nonzeros: 10413
Kind: Directed Multigraph
Author: E. Garfield
Date: 2002
Link: https://sparse.tamu.edu/Pajek/SciMet
Size: 3084x3084
Nonzeros: 10413
Kind: Directed Multigraph
Author: E. Garfield
Date: 2002
Link: https://sparse.tamu.edu/Pajek/SciMet
I mentioned this Over There, so I should here:
A multidisciplinary collective inspired by the Crunk Feminists & Multigraph Collective are in the middle of the proposal/review process with a university press to write a critical introduction & guide to the first 5 years & 20 seasons of Dimension 20.
A multidisciplinary collective inspired by the Crunk Feminists & Multigraph Collective are in the middle of the proposal/review process with a university press to write a critical introduction & guide to the first 5 years & 20 seasons of Dimension 20.
September 4, 2023 at 6:15 PM
I mentioned this Over There, so I should here:
A multidisciplinary collective inspired by the Crunk Feminists & Multigraph Collective are in the middle of the proposal/review process with a university press to write a critical introduction & guide to the first 5 years & 20 seasons of Dimension 20.
A multidisciplinary collective inspired by the Crunk Feminists & Multigraph Collective are in the middle of the proposal/review process with a university press to write a critical introduction & guide to the first 5 years & 20 seasons of Dimension 20.
more general graph problems possibly involving self-loops and multiedges. We study specifically the problems Partially Reflexive Stable Cut and Multigraph Matching Cut in this connection. When one forbids a single (simple) [2/5 of https://arxiv.org/abs/2502.07769v1]
February 12, 2025 at 6:11 AM
more general graph problems possibly involving self-loops and multiedges. We study specifically the problems Partially Reflexive Stable Cut and Multigraph Matching Cut in this connection. When one forbids a single (simple) [2/5 of https://arxiv.org/abs/2502.07769v1]
We are #hiring a Stage for a 6 mois period on Detecting genomic modules across multiple pangenomes using MultiGraph Neural Network, starting 2026-01-01.
More information at maiage.inrae.fr/node/3421.
More information at maiage.inrae.fr/node/3421.
October 10, 2025 at 6:24 AM
We are #hiring a Stage for a 6 mois period on Detecting genomic modules across multiple pangenomes using MultiGraph Neural Network, starting 2026-01-01.
More information at maiage.inrae.fr/node/3421.
More information at maiage.inrae.fr/node/3421.
Yesterday's 'Easily Achieve X0,000s Ops/sec with Multigraph Topology' workshop was awesome.
We started with a standalone machine with 16 cores = 26k queries per second. We tripled and then doubled the number of cores, and achieved linear scalability.
www.youtube.com/watch?v=LbeA...
We started with a standalone machine with 16 cores = 26k queries per second. We tripled and then doubled the number of cores, and achieved linear scalability.
www.youtube.com/watch?v=LbeA...
April 23, 2025 at 1:52 PM
Yesterday's 'Easily Achieve X0,000s Ops/sec with Multigraph Topology' workshop was awesome.
We started with a standalone machine with 16 cores = 26k queries per second. We tripled and then doubled the number of cores, and achieved linear scalability.
www.youtube.com/watch?v=LbeA...
We started with a standalone machine with 16 cores = 26k queries per second. We tripled and then doubled the number of cores, and achieved linear scalability.
www.youtube.com/watch?v=LbeA...
Xiangliang Kong, Shreya Meel, Thomas Jacob Maranzatto, Itzhak Tamo, Sennur Ulukus
New Capacity Bounds for PIR on Graph and Multigraph-Based Replicated Storage
https://arxiv.org/abs/2504.20888
New Capacity Bounds for PIR on Graph and Multigraph-Based Replicated Storage
https://arxiv.org/abs/2504.20888
April 30, 2025 at 4:42 AM
Xiangliang Kong, Shreya Meel, Thomas Jacob Maranzatto, Itzhak Tamo, Sennur Ulukus
New Capacity Bounds for PIR on Graph and Multigraph-Based Replicated Storage
https://arxiv.org/abs/2504.20888
New Capacity Bounds for PIR on Graph and Multigraph-Based Replicated Storage
https://arxiv.org/abs/2504.20888
disjoint union of $k$ copies of $H$, or has a $t$-perturbation with no vertex-minor isomorphic to $H$. Using the same techniques, we also prove that for any planar multigraph $H$, every binary matroid either has a minor isomorphic to the cycle matroid [2/3 of https://arxiv.org/abs/2506.03973v1]
June 5, 2025 at 6:03 AM
disjoint union of $k$ copies of $H$, or has a $t$-perturbation with no vertex-minor isomorphic to $H$. Using the same techniques, we also prove that for any planar multigraph $H$, every binary matroid either has a minor isomorphic to the cycle matroid [2/3 of https://arxiv.org/abs/2506.03973v1]
However, the variant where the partition is not given, termed BDR, is still open.
For bipartite multigraph realizations, there are also two variants. For BDR$^P$, where the partition is given as part of the input, a [4/9 of https://arxiv.org/abs/2501.15515v1]
For bipartite multigraph realizations, there are also two variants. For BDR$^P$, where the partition is given as part of the input, a [4/9 of https://arxiv.org/abs/2501.15515v1]
January 28, 2025 at 6:11 AM
However, the variant where the partition is not given, termed BDR, is still open.
For bipartite multigraph realizations, there are also two variants. For BDR$^P$, where the partition is given as part of the input, a [4/9 of https://arxiv.org/abs/2501.15515v1]
For bipartite multigraph realizations, there are also two variants. For BDR$^P$, where the partition is given as part of the input, a [4/9 of https://arxiv.org/abs/2501.15515v1]
after some googling i learned that the term i was looking for is "directed multigraph"
severance modus
structure: multigraph
storage: items are defined through "tags" (which correspond to edges of the graph) related to its existence (e.g manner of acquisition: purchase)
retrieval: overwriting these edges through lying to the modus (where lies generate void=garbled data)
structure: multigraph
storage: items are defined through "tags" (which correspond to edges of the graph) related to its existence (e.g manner of acquisition: purchase)
retrieval: overwriting these edges through lying to the modus (where lies generate void=garbled data)
October 5, 2025 at 11:05 AM
after some googling i learned that the term i was looking for is "directed multigraph"
from a dot product of copies of the Petersen graph by replacing its vertices with 2-edge-connected planar cubic (multi)graphs. Here, replacing a vertex $v$ in a cubic graph $G$ is the operation that takes a 2-connected planar cubic multigraph $H$ and [4/8 of https://arxiv.org/abs/2505.07002v1]
May 13, 2025 at 6:04 AM
from a dot product of copies of the Petersen graph by replacing its vertices with 2-edge-connected planar cubic (multi)graphs. Here, replacing a vertex $v$ in a cubic graph $G$ is the operation that takes a 2-connected planar cubic multigraph $H$ and [4/8 of https://arxiv.org/abs/2505.07002v1]
Happy 122nd birthday anniversary to (2)
Laminated Safety Glass
Chromatography
Spinning Tops
Phonograph Music box
Panama's Independence
Stock Car racing
Multigraph Duplication Printing Machine
Crayola Crayons
Tea Bags
Laminated Safety Glass
Chromatography
Spinning Tops
Phonograph Music box
Panama's Independence
Stock Car racing
Multigraph Duplication Printing Machine
Crayola Crayons
Tea Bags
September 9, 2025 at 5:23 PM
Happy 122nd birthday anniversary to (2)
Laminated Safety Glass
Chromatography
Spinning Tops
Phonograph Music box
Panama's Independence
Stock Car racing
Multigraph Duplication Printing Machine
Crayola Crayons
Tea Bags
Laminated Safety Glass
Chromatography
Spinning Tops
Phonograph Music box
Panama's Independence
Stock Car racing
Multigraph Duplication Printing Machine
Crayola Crayons
Tea Bags