Construction of a transitive orientation using B-stable subgraphs
A special method for construction of transitive orientations of the undirected graph $G=(X;U)$ is proposed. The method uses an iterative procedure for factorization of graph $G$. Factorization procedure consists in replacing of a B-stable subgraph with a vertex. Transitive orientations are obtained...
Main Author: | Nicolae Grigoriu |
---|---|
Format: | Article |
Language: | English |
Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2015-05-01
|
Series: | Computer Science Journal of Moldova |
Subjects: | |
Online Access: | http://www.math.md/files/csjm/v23-n1/v23-n1-(pp11-23).pdf.pdf |
Similar Items
-
An Optimization of Closed Frequent Subgraph Mining Algorithm
by: Demetrovics J., et al.
Published: (2017-03-01) -
Forbidden subgraph pairs for traceability of block-chains
by: Binlong Li, et al.
Published: (2013-04-01) -
An Efficient Subgraph Isomorphism Solver for Large Graphs
by: Zubair Ali Ansari, et al.
Published: (2021-01-01) -
Learning with Small Data: Subgraph Counting Queries
by: Kangfei Zhao, et al.
Published: (2023-09-01) -
Eigenvalue Conditions for Induced Subgraphs
by: Harant Jochen, et al.
Published: (2015-05-01)