About S-packing coloring of 3-irregular subcubic graphs.
Maidoun MortadaPublished in: Discret. Appl. Math. (2024)
Keyphrases
- graph matching
- irregularly shaped
- case study
- graph mining
- structured objects
- series parallel
- arbitrarily shaped
- packing problem
- graph representation
- real time
- graph theory
- directed graph
- graph model
- graph databases
- connected components
- small world
- network structure
- subgraph isomorphism
- pattern recognition
- machine learning
- neural network