Results 1 to 10 of about 5,172,585 (353)
Graphs whose line graphs are ring graphs [PDF]
Given a graph H, a path of length at least two is called an H-path if meets H exactly in its ends. A graph G is a ring graph if each block of G which is not a bridge or a vertex can be constructed inductively by starting from a single cycle and then in ...
Mahdi Reza Khorsandi
doaj +2 more sources
TransLiG: a de novo transcriptome assembler that uses line graph iteration. [PDF]
We present TransLiG, a new de novo transcriptome assembler, which is able to integrate the sequence depth and pair-end information into the assembling procedure by phasing paths and iteratively constructing line graphs starting from splicing graphs ...
Liu J, Yu T, Mu Z, Li G.
europepmc +2 more sources
Treewidth of the Line Graph of a Complete Graph [PDF]
AbstractIn recent articles by Grohe and Marx, the treewidth of the line graph of a complete graph is a critical example—in a certain sense, every graph with large treewidth “contains” . However, the treewidth of was not determined exactly. We determine the exact treewidth of the line graph of a complete graph.
Daniel J. Harvey, D. Wood
semanticscholar +3 more sources
In this note we define two generalizations of the line graph and obtain some results. Also, we mark some open problems.
Reddy, P. Siva Kota +2 more
openaire +4 more sources
Line graphs of directed graphs I [PDF]
We determine the forbidden induced subgraphs for the intersection of the classes of chordal bipartite graphs and line graphs of acyclic directed graphs. This is a first step towards finding the forbidden induced subgraphs for the class of line graphs of ...
Vaidyanathan Sivaraman, Daniel Slilaty
doaj +5 more sources
Modeling functional connectivity changes during an auditory language task using line graph neural networks [PDF]
Functional connectivity (FC) refers to the activation correlation between different brain regions. FC networks as typically represented as graphs with brain regions of interest (ROIs) as nodes and functional correlation as edges.
Stein Acker +9 more
doaj +2 more sources
ILIGRA: An Efficient Inverse Line Graph Algorithm
This paper presents a new and efficient algorithm, ILIGRA, for inverse line graph construction. Given a line graph H, ILIGRA constructs its root graph G with the time complexity being linear in the number of nodes in H.
Dajie Liu, S. Trajanovski, P. Mieghem
semanticscholar +3 more sources
Atomistic Line Graph Neural Network for improved materials property predictions [PDF]
Graph neural networks (GNN) have been shown to provide substantial performance improvements for atomistic material representation and modeling compared with descriptor-based machine learning models.
K. Choudhary, Brian L. DeCost
semanticscholar +1 more source
LGESQL: Line Graph Enhanced Text-to-SQL Model with Mixed Local and Non-Local Relations [PDF]
This work aims to tackle the challenging heterogeneous graph encoding problem in the text-to-SQL task. Previous methods are typically node-centric and merely utilize different weight matrices to parameterize edge types, which 1) ignore the rich semantics
Ruisheng Cao +5 more
semanticscholar +1 more source
Line Graph Neural Networks for Link Weight Prediction [PDF]
In real-world networks, predicting the weight (strength) of links is as crucial as predicting the existence of the links themselves. Previous studies have primarily used shallow graph features for link weight prediction, limiting the prediction ...
Jinbi Liang, Cunlai Pu
semanticscholar +1 more source

