Bipartite Graph Representation

Bipartite Graph Representation is a hypergraph visualization method that encodes a hypergraph as a bipartite graph by distinguishing two disjoint sets of nodes—hypernodes and hyperedges—such that incidences between hypernodes and hyperedges in the original hypergraph are represented as binary edges in the bipartite structure.

877

Publications

45.6K

Citations

2.3K

Authors

830

Institutions

Publications per year

2017–2026

286

Authors

2.3K

  1. FN
    Feiping Nie

    Northwestern Polytechnical University, China

    12 publications · 1.1K citations

    12

    h-index

  2. XL
    Xuemin Lin

    UNSW Sydney, Australia

    8 publications · 411 citations

    8

    h-index

  3. WZ
    Wenjie Zhang

    UNSW Sydney, Australia

    8 publications · 327 citations

    8

    h-index

  4. XL
    Xuelong Li

    Northwestern Polytechnical University, China

    6 publications · 292 citations

    6

    h-index

  5. KW
    Kai Wang

    UNSW Sydney, Australia

    6 publications · 220 citations

    6

    h-index

1–5 of 2.3K

Venues

  1. Discrete Mathematics

    56 publications · 1.3K citations

    20

    h-index

  2. Journal of Combinatorial Theory Series B

    20 publications · 1.1K citations

    17

    h-index

  3. Discrete Applied Mathematics

    22 publications · 717 citations

    15

    h-index

  4. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 16 publications · 1.1K citations

    14

    h-index

  5. arXiv (Cornell University)

    Repository · 18 publications · 1.7K citations

    12

    h-index

1–5