Efficient Enumeration of Graph Orientations With Sources

Discrete Applied Mathematics - Netherlands
doi 10.1016/j.dam.2017.08.002
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Efficient Maximal Clique Enumeration Over Graph Data

Data Science and Engineering
Computational MechanicsComputer Science Applications
2016English

Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2019English

Edge Dominating Set: Efficient Enumeration-Based Exact Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

On Efficient Parallelizing of the Algorithms for Discrete Enumeration Problems

Machine Learning and Data Analysis
2015English

An Efficient Graph Indexing Method

2012English

Interpolation Theorem for a Continuous Function on Orientations of a Simple Graph

Czechoslovak Mathematical Journal
Mathematics
1998English

Memory Efficient Anonymous Graph Exploration

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Efficient Learning of Non-Autoregressive Graph Variational Autoencoders for Molecular Graph Generation

Journal of Cheminformatics
Computer GraphicsInformation SciencesLibraryTheoretical ChemistryComputer Science ApplicationsComputer-Aided DesignPhysical
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy