{"entities":{"Q3927068":{"pageid":5956973,"ns":120,"title":"Item:Q3927068","lastrevid":87830750,"modified":"2026-06-04T12:56:58Z","type":"item","id":"Q3927068","labels":{"en":{"language":"en","value":"Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3741162"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3927068$6093FDA8-A6E2-420A-8FC3-1DAAA66886DC","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"d67077575dc92b173ff15cf3c27a74cb86c9eeaa","datavalue":{"value":{"text":"Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q3927068$3E12DACB-F5CB-4E8A-B78E-ED3CA8DF77B7","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"42b1a61db7aa180647d8fe33927ab62646d2d043","datavalue":{"value":"0472.90066","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3927068$DF16CD4D-1130-40C0-99D1-A9AB03E9A1BE","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"34146e9d124eb8f57a6231e1825b5fc0d1c34b9a","datavalue":{"value":{"entity-type":"item","numeric-id":2713139,"id":"Q2713139"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3927068$813525B9-9A65-450B-9131-49C4FE11432C","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"50fad0db7dc87cb4e51866acdb5ccbaa54ec857b","datavalue":{"value":{"time":"+1981-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q3927068$07D4F6BA-036E-49C4-AE71-12CA82FD56A3","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"a7b5ab2c1ca7250eb8023f1d98e0c7c04022353d","datavalue":{"value":"https://eudml.org/doc/104787","type":"string"},"datatype":"url"},"type":"statement","id":"Q3927068$803AD4D6-3C00-4AD8-B5FB-FD1868DD5DE3","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"d2d4f4e28fa9ca38421c473fcb6ba728a44de59a","datavalue":{"value":"90C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3927068$276344F5-D3DA-45FE-BD61-C8B6BA2678C8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"5a3bb76dbd41580d9287ece5137de80ddf22202f","datavalue":{"value":"05C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3927068$0DDDCF31-FF34-48BD-B51D-FCD003CA743A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"f3a5e47548ef139717b317f83801cfef606a623d","datavalue":{"value":"05C38","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3927068$DDE3F9CB-CCC9-4649-A306-07CA4457CA36","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"3feee98fb6a1a95642ba0c6a16390527874922bf","datavalue":{"value":"90C10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3927068$C0B5C5D8-C9CC-4E7F-9D2A-12A63971934D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"0b4fa5b59eb6fe6e43618f9e005f4a49f4390971","datavalue":{"value":"65K05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3927068$8C3F2983-8C21-40AF-9BE0-B513651F2AAB","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"c06717c05a796570768205954d07d42074c58f61","datavalue":{"value":"3741162","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3927068$139BF630-E573-4D69-BDCC-7B6F20F2C029","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4229bcd9fa74cf83b97b8977eb1aa781a7c7c002","datavalue":{"value":"computational comparison of methods","type":"string"},"datatype":"string"},"type":"statement","id":"Q3927068$AD5CF356-F1C7-4B80-8A9F-8413FAC3F062","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0e27763cf6f2e5658617db8fa485b6a1bf9e9310","datavalue":{"value":"shortest complete cycle","type":"string"},"datatype":"string"},"type":"statement","id":"Q3927068$D37EC03D-5F1B-42AA-B21E-3EA8C12D1197","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"bcaef8b48097d50a08be2219f6311c65284708bf","datavalue":{"value":"circuit","type":"string"},"datatype":"string"},"type":"statement","id":"Q3927068$7D7BF672-54D8-4D5D-9A74-EAA27D2592A9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"963f8a44a3cf044d521491038f8544ecc1182d13","datavalue":{"value":"equivalent Hamiltonian cycle problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q3927068$FC1A8FED-0D87-407E-ADF5-890FB6943C73","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f2547fe05fc38d862a3c0fa5dd3d72d33319bce3","datavalue":{"value":"computational experience","type":"string"},"datatype":"string"},"type":"statement","id":"Q3927068$69A92A28-EA9E-4868-B179-F70901CEB2CE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"bd8da04936b613700d229f8ae9da36acd954b5ef","datavalue":{"value":"graphs with random complete distance matrices","type":"string"},"datatype":"string"},"type":"statement","id":"Q3927068$13C9A657-C4F0-41E1-9FEB-5C619B9DAA8B","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3927068$1621E9F5-BCF0-47C5-AB03-409E01C96B0E","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"032f6f211f0eb0851ffb5ead68fa56f28917e997","datavalue":{"value":"W2586862314","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3927068$497EE350-F8BF-4D5F-A37D-C067608262C1","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"62c33b79a33675352a7a92a6c5aff1a0e639ed49","datavalue":{"value":"10.1051/RO/1981150302331","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3927068$C5AD7717-0EAB-42CC-A770-05F5BDE8BB29","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph","badges":[]}}}}}