Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,179,917 papers from all fields of science
Search
Sign In
Create Free Account
Journal of Graph Algorithms and Applications
Known as:
JGAA
The Journal of Graph Algorithms and Applications is an open access peer-reviewed scientific journal covering the subject of graph algorithms and…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
19 relations
Angular resolution (graph drawing)
Arc diagram
Circular layout
Clique problem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparison
Christian Komusiewicz
,
Frank Sommer
Conference on Current Trends in Theory and…
2019
Corpus ID: 58007444
We consider the problem of enumerating all connected induced subgraphs of order k in an undirected graph \(G=(V,E)\). Our main…
Expand
2018
2018
Contracting to a Longest Path in H-Free Graphs
W. Kern
,
D. Paulusma
International Symposium on Algorithms and…
2018
Corpus ID: 52915989
We prove two dichotomy results for detecting long paths as patterns in a given graph. The NP-hard problem Longest Induced Path is…
Expand
2013
2013
Advancements on SEFE and Partitioned Book Embedding problems
Patrizio Angelini
,
G. D. Lozzo
,
Daniel Neuwirth
Theoretical Computer Science
2013
Corpus ID: 17383887
2011
2011
Surface Split Decompositions and Subgraph Isomorphism in Graphs on Surfaces
P. Bonsma
Symposium on Theoretical Aspects of Computer…
2011
Corpus ID: 15118623
The Subgraph Isomorphism problem asks, given a host graph G on n vertices and a pattern graph P on k vertices, whether G contains…
Expand
Highly Cited
2009
Highly Cited
2009
Parallel community detection on large networks with propinquity dynamics
Yuzhou Zhang
,
Jianyong Wang
,
Yang Wang
,
Lizhu Zhou
Knowledge Discovery and Data Mining
2009
Corpus ID: 5953642
Graphs or networks can be used to model complex systems. Detecting community structures from large network data is a classic and…
Expand
2009
2009
Lower bounds for three algorithms for transversal hypergraph generation
Matthias Hagen
Discrete Applied Mathematics
2009
Corpus ID: 42390371
2008
2008
Familiar Layouts Generation for Metabolic Pathway Graph Visualization
Wang Yuan
2008
Corpus ID: 125111347
by
2008
2008
Une étude de l'intégration organisationnelle et informationnelle. Application aux systèmes d'informations de type ERP. (An analysis of organizational and informational integration. Application to ERP…
P. Millet
2008
Corpus ID: 38904474
The Information Systems of enterprises are build with commercial software packages, configured, integrated and implemented in…
Expand
2006
2006
Chordal Graphs as Intersection Graphs of Pseudosegments
Cornelia Dangelmayr
,
S. Felsner
International Symposium Graph Drawing and Network…
2006
Corpus ID: 15685766
We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. The main contribution is a…
Expand
2003
2003
Hamilton Decompositions and (n/2)-Factorizations of Hypercubes
D. Bass
,
I. H. Sudborough
J. Graph Algorithms Appl.
2003
Corpus ID: 18191559
Since Qn, the hypercube of dimension n, is known to have n linkdisjoint paths between any two nodes, the links of Qn can be…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE