Finding strongly connected components of simple digraphs based on granulation strategy
DOI10.1016/j.ijar.2019.12.001zbMath1468.68245OpenAlexW2996106260MaRDI QIDQ2302953
Jie Yang, Taihua Xu, Guo-Yin Wang
Publication date: 26 February 2020
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2019.12.001
Graph theory (including graph drawing) in computer science (68R10) Reasoning under uncertainty in the context of artificial intelligence (68T37) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Path-based depth-first search for strong and biconnected components
- Graph and matrix approaches to rough sets through matroids
- Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components
- Relationships among generalized rough sets in six coverings and pure reflexive neighborhood system
- A strong-connectivity algorithm and its applications in data flow analysis
- Rough set approach to knowledge-based decision support
- A three-way clustering approach for handling missing data using GTRS
- Simple graphs in granular computing
- Cost-sensitive three-way class-specific attribute reduction
- Two views of the theory of rough sets in finite universes
- Accelerated low-rank representation for subspace clustering and semi-supervised classification on large-scale data
- Min-max attribute-object bireducts: on unifying models of reducts in rough set theory
- Certain information granule system as a result of sets approximation by fuzzy context
- Generalized multi-scale decision tables with multi-scale decision attributes
- The adjacency matrix of a graph as a data table: a geometric perspective
- Equivalent characterizations of some graph problems by covering-based rough sets
- Finding strongly connected components in distributed graphs
- The university of Florida sparse matrix collection
- Multi-core Nested Depth-First Search
- Parallel Nested Depth-First Searches for LTL Model Checking
- Rough Set Theory Applied to Simple Undirected Graphs
- Lattice Theory for Rough Sets
- Rough sets
- Generalizations of Rough Set Tools Inspired by Graph Theory
- Improved Multi-Core Nested Depth-First Search
- Parallel Explicit Model Checking for Generalized Büchi Automata
- Digraphs
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: Finding strongly connected components of simple digraphs based on granulation strategy
