BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Graph explorer

Pairwise Comparisons Simplified

This study examines the notion of generators of a pairwise comparisons matrix. Such approach decreases the number of pairwise comparisons from $n\cdot (n-1)$ to $n-1$. An algorithm of reconstructing of the PC matrix from its set of generators is presented.

5 nodes4 linksoverview previewPairwise Comparisons Simplified
SearchCollections
5 nodes4 links
Pairwise Comparisons Simplified5 visible / 5 total nodes / 5 links
Co-authorshipAuthorshipAuthorshipTopic signalTopic signalWPairwise Comparisons Simplifiedpreprint / 2013AW. W. KoczkodajResearcherAJ. SzybowskiResearcherTComputer Science and Ga...1864 worksTDiscrete Mathematics1775 works
PaperSignal 104 links

Pairwise Comparisons Simplified

preprint / 2013

Open

Personal maps

Sign in to save graph views

Saved views keep the query, focus and filters attached to this map.

Sign in

Public snapshots

1 shared view(s)