Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
acyclic graphs
Description:
Acyclic graphs are graphs containing no cycles, meaning no path returns to its starting vertex without repeating edges.
Related topics:
Complexity and Algorithms in Graphs (15%),
Advanced Graph Theory Research (12%),
Graph theory and applications (9%)
Wikidata ID:
wiki/Q3115453
OpenAlex ID:
keywords/acyclic-graphs
Reverse search for enumeration
1996
·
David Avis
, Komei Fukuda
·
Discrete Applied Mathematics
·
897
An Introduction to Structured Modeling
1987
·
Arthur M. Geoffrion
·
Management Science
·
602
Variations on the Common Subexpression Problem
1980
·
Peter J. Downey
, Ravi Sethi
, et al.
·
Journal of the ACM
·
407
PDF
The Quasi-Wiener and the Kirchhoff Indices Coincide
1996
·
Ivan Gutman
, Bojan Mohar
·
Journal of Chemical Information and Computer Sciences
·
373
Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks
2004
·
Weixiong Zhang
, Guandong Wang
, et al.
·
Artificial Intelligence
·
340
Domination and location in acyclic graphs
1987
·
Peter J. Slater
·
Networks
·
273
Computational Capabilities of Graph Neural Networks
2008
·
F. Scarselli
, M. Gori
, et al.
·
IEEE Transactions on Neural Networks
·
263
New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks
1978
·
A. Satyanarayana
, A. Prabhakar
·
IEEE Transactions on Reliability
·
263
Distance matrix polynomials of trees
1978
·
R.L Graham
, L Lovász
·
Advances in Mathematics
·
246
Suffix ordering and morphological processing
2009
·
Ingo Plag
, Harald Baayen
·
Language
·
208
PDF
Cyclic and non-cyclic scheduling of 12 h shift nurses by network programming
1998
·
Harvey H. Millar
, Mona Kiragu
·
European Journal of Operational Research
·
171
Isomer discrimination by topological information approach
1981
·
D. Bonchev
, O. V. Mekenyan
, et al.
·
Journal of Computational Chemistry
·
164
Fair Division of a Graph
2017
·
Sylvain Bouveret
, Katarína Cechlárová
, et al.
·
International Joint Conference on Artificial Intelligence
·
160
PDF
A Grammatical Approach to Self-Organizing Robotic Systems
2006
·
E. Klavins
, R. Ghrist
, et al.
·
IEEE Transactions on Automatic Control
·
160
An algorithm for finding the nucleolus of assignment games
1994
·
Tam�s Solymosi
, Tirukkannamangai E. S. Raghavan
·
International Journal of Game Theory
·
154
Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power Flow
2015
·
Subhonmesh Bose
, Dennice F. Gayme
, et al.
·
IEEE Transactions on Control of Network Systems
·
145
PDF
Formation control for a cooperative multi-agent system using decentralized navigation functions
2006
·
M.C. De Gennaro
, A. Jadbabaie
·
Proceedings of the ... American Control Conference/Proceedings of the American Control Conference
·
142
An improved FPTAS for Restricted Shortest Path
2002
·
Funda Ergun
, Rakesh Sinha
, et al.
·
Information Processing Letters
·
134
Trees in Polyhedral Graphs
1966
·
David Barnette
·
Canadian Journal of Mathematics
·
128
PDF
Synthesis of timed asynchronous circuits
1993
·
C.J. Myers
, T.H.-Y. Meng
·
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
·
126
Note on the comparison of the first and second normalized zagreb eccentricity indices.
2010
·
Damir Vukičević
, Ante Graovac
·
PubMed
·
119
Forbidden paths and cycles in ordered graphs and matrices
2006
·
János Pach
, Gábor Tardos
·
Israel Journal of Mathematics
·
117
PDF
NP-completeness of some edge-disjoint paths problems
1995
·
Jens Vygen
·
Discrete Applied Mathematics
·
117
PDF
Burning a graph is hard
2017
·
Stéphane Bessy
, Anthony Bonato
, et al.
·
Discrete Applied Mathematics
·
115
PDF
Fixed‐edge theorem for graphs with loops
1979
·
Richard Nowakowski
, Ivan Rival
·
Journal of Graph Theory
·
114
Show more works
View as search
Works count:
1,058
Citation count:
16,020
Year
Topic
Type