Facial unique-maximum colorings of plane graphs with restriction on big vertices.
Bernard LidickýKacy MesserschmidtRiste SkrekovskiPublished in: Discret. Math. (2019)
Keyphrases
- weighted graph
- labeled graphs
- random graphs
- undirected graph
- adjacency matrix
- hamiltonian cycle
- attributed graphs
- graph coloring
- connected subgraphs
- face recognition
- facial images
- planar graphs
- directed edges
- three dimensional
- average degree
- graph matching
- graph partitioning
- simple polygon
- graph theoretic
- graph theory
- landmark detection
- vertex set
- face images
- facial expressions
- edge weights
- graph representation
- maximum cardinality
- connected graphs
- human faces
- graph clustering
- maximal cliques
- age estimation
- facial features
- directed graph
- shortest path
- facial expression recognition
- facial recognition
- high resolution
- query graph
- big data
- job shop scheduling
- graph data
- combinatorial problems
- graph structure
- graph model