|
|
|
|
| LEADER |
01000naa a22002652c 4500 |
| 001 |
NLM39201730X |
| 003 |
DE-627 |
| 005 |
20250906233554.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
250906s2025 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TVCG.2025.3577533
|2 doi
|
| 028 |
5 |
2 |
|a pubmed25n1558.xml
|
| 035 |
|
|
|a (DE-627)NLM39201730X
|
| 035 |
|
|
|a (NLM)40478716
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Forster, Henry
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a GraphTrials
|b Visual Proofs of Graph Properties
|
| 264 |
|
1 |
|c 2025
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Revised 05.09.2025
|
| 500 |
|
|
|a published: Print
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a Graph and network visualization supports exploration, analysis and communication of relational data arising in many domains: from biological and social networks, to transportation and powergrid systems. With the arrival of AI-based question-answering tools, issues of trustworthiness and explainability of generated answers motivate a significant new role for visualization. In the context of graphs, we see the need for visualizations that can convince a critical audience that an assertion (e. g., from an AI) about the graph under analysis is valid. The requirements for such representations that convey precisely one specific graph property are quite different from standard network visualization criteria which optimize general aesthetics and readability. In this paper, we aim to provide a comprehensive introduction to visual proofs of graph properties and a foundation for further research in the area. We present a framework that defines what it means to visually prove a graph property. In the process, we introduce the notion of a visual certificate, that is, a specialized faithful graph visualization that leverages the viewer's perception, in particular, pre-attentive processing (e. g., via pop-out effects), to verify a given assertion about the represented graph. We also discuss the relationships between visual complexity, cognitive load and complexity theory, and propose a classification based on visual proof complexity. Then, we provide further examples of visual certificates for problems in different visual proof complexity classes. Finally, we conclude the paper with a discussion of the limitations of our model and some open problems
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Klesen, Felix
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Dwyer, Tim
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Eades, Peter
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Hong, Seok-Hee
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Kobourov, Stephen
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Liotta, Giuseppe
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Misue, Kazuo
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Montecchiani, Fabrizio
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Pastukhov, Alexander
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Schreiber, Falk
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on visualization and computer graphics
|d 1996
|g 31(2025), 10 vom: 01. Sept., Seite 8767-8781
|w (DE-627)NLM098269445
|x 1941-0506
|7 nnas
|
| 773 |
1 |
8 |
|g volume:31
|g year:2025
|g number:10
|g day:01
|g month:09
|g pages:8767-8781
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TVCG.2025.3577533
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 31
|j 2025
|e 10
|b 01
|c 09
|h 8767-8781
|